Nash Implementation: A Full Characterization

  title={Nash Implementation: A Full Characterization},
  author={John. Moore and Rafael Repullo},
The authors extend E. Maskin's results on Nash implementation. First, they establish a condition that is both necessary and sufficient for Nash implementability if there are three or more agents (the case covered by Maskin's sufficiency result). Second--and more important--they examine the two-agent case (for which there existed no general sufficiency results). The two-agent model is the leading case for applications to contracting and bargaining. For this case, too, they establish a condition… 
Reconsidering two-agent Nash implementation
It is shown that Maskin’s impossibility result can be avoided under restrictions on the outcomes and the domain of preferences much weaker than those previously imposed by Moore and Repullo and Dutta and Sen.
Nash implementation with a private good
Summary. I construct a general model of social planning problems, including mixed production economies and regulatory problems with negative externalities as special cases, and I give simple
A characterization of the Walras rule
This paper has three purposes. First, we refine the characterization of the Walras rule proposed by Nagahisa (JET 1991) over a more natural and simple domain than the one he employed. We show that
On the necessary and sufficient conditions for Nash implementation
The purpose of this paper is to provide a constructive way of checking whether or not a social choice correspondence can be implemented in Nash equilibria. The results apply when there are two or
Reasonable Mechanisms and Nash Implementation
The theory of implementation is concerned with the design of schemes or mechanisms which will induce individual agents to reveal correctly privately-held information for public use. Since much of
Implementation with Evidence
This work generalizes the canonical problem of Nash implementation by allowing agents to voluntarily provide discriminatory signals, i.e., evidence, and forms a more general property, evidence monotonicity, and shows that this is a necessary condition for implementation.
Nash-Implementation of the No-Envy Solution on Symmetric Domains of Economies
It is shown that a simple game form, which resembles the “Divide-and-Choose” procedure, Nash-implements the no-envy solution on domains of economies where the set of feasible allocations is symmetric and preferences are complete.