Virtual Nash implementation with admissible support

Olivier Bochet () and Francois Maniquet

No 2006084, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: A social choice correspondence (SCC) is virtually implementable if it is e-close (in the probability simplex) to some (exactly) implementable correspondence. Abreu and Sen (1991) proved that, without restriction on the set of alternatives receiving strictly positive probability at equilibrium, every SCC is virtually implementable in Nash Equilibrium. We study virtual implementation when the supports of equilibrium lotteries are restricted. We provide a necessary and sufficient condition, imposing joint restrictions on SCCs and admissible supports. Then, we discuss how to construct supports. Finally, we study virtual implementation when the support is restricted to the efficient or individually rational alternatives.

Date: 2006-10
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2006.html (text/html)

Related works:
Journal Article: Virtual Nash implementation with admissible support (2010)
Working Paper: Virtual Nash implementation with admissible support (2010)
Working Paper: Virtual Nash implementation with admissible support (2006)
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:cor:louvco:2006084

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().