ON THE NON-ROBUSTNESS OF NASH IMPLEMENTATION
Departmental Working Papers from McGill University, Department of Economics
I consider the implementation problem under complete information and employ Nash equilibrium as a solution concept. A socially desirable rule is given as a correspondence from the set of states to the set of outcomes. This social choice rule is said to be implementable in Nash equilibrium if there exists a mechanism such that all (pure strategy)Nash equilibrium outcomes are socially desirable. Maskin (1999) clarified the conditions on the social choice rules under which he was able to construct a general Nash implementing mechanism when there are at least three players. This paper identifies the minimal amount of incomplete information which prevents the Maskinian mechanism from being robustly implemented in Nash equilibrium. More precisely, with mild constrains on the social choice rules, one can construct a canonical perturbation of the complete information structure under which a sequence of Bayesian Nash equilibria of the Maskinian mechanism supports a non-Nash equilibrium outcome in the limit of the space of the original complete information structure. Therefore, there is a minimal sense in which the Maskinian mechanism is not robust to incomplete information. This non-robustness result is also extended to the environment with two players.
JEL-codes: C72 D78 D82 D83 (search for similar items in EconPapers)
Pages: 24 pages
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
Our link check indicates that this URL is bad, the error code is: 403 Forbidden
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:mcl:mclwop:2006-25
Access Statistics for this paper
More papers in Departmental Working Papers from McGill University, Department of Economics Contact information at EDIRC.
Bibliographic data for series maintained by Shama Rangwala ( this e-mail address is bad, please contact ).