Simplicity-Expressiveness Tradeoffs in Mechanism Design
MetadataShow full item record
CitationDütting, Paul, Felix Fischer and David C. Parkes. Forthcoming. Simplicity-Expressiveness Tradeoffs in Mechanism Design. In Proceedings of the 12th ACM Conference on Electronic Commerce, June 5-9, 2011, San Jose, CA.
AbstractA fundamental result in mechanism design theory, the so-called revelation principle, asserts that for many questions concerning the existence of mechanisms with a given outcome one can restrict attention to truthful direct-revelation mechanisms. In practice, however, many mechanisms use a restricted message space. This motivates the study of the tradeoffs involved in choosing simplified mechanisms, which can sometimes bring benefits in precluding bad or promoting good equilibria, and other times impose costs on welfare and revenue. We study the simplicity-expressiveness tradeoff in two representative settings, sponsored search auctions and combinatorial auctions, each being a canonical example for complete information and incomplete information analysis, respectively. We observe that the amount of information available to the agents plays an important role for the tradeoff between simplicity and expressiveness.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:4892934
- FAS Scholarly Articles 
Contact administrator regarding this item (to report mistakes or request changes)