Nash implementation theory -- A note on full characterizations
The first full characterization of social choice correspondences that are implementable in Nash equilibrium, given in Moore and Repullo (1990), together with the working principle behind an algorithm to check this condition, given in Sjöström (1991), can be used to give a simple necessary and sufficient condition for implementation that is a generalization of monotonicity.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:108:y:2010:i:3:p:283-285. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.