Computer Science – Computer Science and Game Theory
Scientific paper
2011-02-17
Computer Science
Computer Science and Game Theory
Scientific paper
A 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 mechanism 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.
Dütting Paul
Fischer Felix
Parkes David C.
No associations
LandOfFree
Simplicity-Expressiveness Tradeoffs in Mechanism Design does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Simplicity-Expressiveness Tradeoffs in Mechanism Design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simplicity-Expressiveness Tradeoffs in Mechanism Design will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-380894