Implementation with Near-Complete Information
Many refinements of Nash equilibrium yield solution correspondences that do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a desired outcome, and entertains the possibility that players may have even the slightest uncertainty about payoffs, then the planner should insist on a solution concept with closed graph. We show that this requirement entails substantial restrictions on the set of implementable social choice rules. In particular, when preferences are strict (or more generally, hedonic), while almost any social choice function can be implemented in undominated Nash equilibrium, only monotonic social choice functions can be implemented in the closure of the undominated Nash correspondence. Copyright Econometric Society, 2002.
Year of publication: |
2003
|
---|---|
Authors: | Chung, Kim-Sau ; Ely, Jeffrey C. |
Published in: |
Econometrica. - Econometric Society. - Vol. 71.2003, 3, p. 857-871
|
Publisher: |
Econometric Society |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Efficient and Dominance Solvable Auctions with Interdependent Valuations
Chung, Kim-Sau, (2000)
-
Implementation with Near-Complete Information
Chung, Kim-Sau, (2001)
-
Ex-Post Incentive Compatible Mechanism Design
Ely, Jeffrey C., (2002)
- More ...