Implementation with Near-Complete Information

Kim-Sau Chung and Jeffrey Ely

Econometrica, 2003, vol. 71, issue 3, 857-871

Abstract: 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.

Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (42)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Working Paper: Implementation with Near-Complete Information (2001)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecm:emetrp:v:71:y:2003:i:3:p:857-871

Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues

Access Statistics for this article

Econometrica is currently edited by Guido Imbens

More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().