Virtual Implementation in Iteratively Undominated Strategies: Complete Information
AbstractThe authors investigate the implementation of social choice functions that map to lotteries over alternatives. They require virtual implementation in iteratively undominated strategies. Under very weak domain restrictions, they show that if there are three or more players, any social choice function may be so implemented. The literature on implementation in Nash equilibrium and its refinements is compromised by its reliance on game forms with unnatural features (for example, "integer games") or "modulo" constructions with mixed strategies arbitrarily excluded. In contrast, the authors' results employ finite (consequently "well-behaved") mechanisms and allow for mixed strategies. Copyright 1992 by The Econometric Society.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Econometric Society in its journal Econometrica.
Volume (Year): 60 (1992)
Issue (Month): 5 (September)
Other versions of this item:
- Abreu, D. & Matsushima, H., 1991. "Virtual Implementation in Iteratively Undominated Strategies: Incomplete Information," Working Papers e-91-1, Hoover Institution, Stanford University.
- Abreu, D. & Matsushima, H., 1991. "Virtual Implementation in Iteratively Undominated Strategies: Incomplete Information," Working Papers e-91-2, Hoover Institution, Stanford University.
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.