December 11, Tuesday
12:00 – 14:00
Can Simple Markets Achieve Good Results?
Computer Science seminar
Lecturer : Dr. Liad Blumrosen
Lecturer homepage : http://research.microsoft.com/users/liadbl/
Affiliation : Microsoft Research, Silicon Valley
Location : 202/37
Host : Dr. Danny Barash
This talk will survey several results characterizing tradeoffs between the simplicity of markets and their achievable economic properties. On the positive side, nearly optimal markets exist even when the agents have restricted expressive power. On the negative side, we show that the communication overhead of computing equilibrium-supporting prices may be significant. Finally, we show that simple pricing schemes cannot support close-to-optimal results in ascending-price multi-unit auctions.
Based on joint works with Moshe Babaioff, Michal Feldman, Moni Naor, Noam Nisan, Michael Schapira and Ilya Segal.