Robust virtual implementation
In a general interdependent preference environment, we characterize when two payoff types can be distinguished by their rationalizable strategic choices without any prior knowledge of their beliefs and higher order beliefs. We show that two payoff types are strategically distinguishable if and only if they satisfy a separability condition. The separability condition for each agent essentially requires that there is not too much interdependence in preferences across agents. A social choice function, mapping payoff type profiles to outcomes, can be robustly virtually implemented if there exists a mechanism such that every equilibrium on every type space achieves an outcome that is arbitrarily close to the outcome generated by the social choice function. This definition is equivalent to requiring virtual implementation in iterated deletion of strategies that are strictly dominated for all beliefs. The social choice function is robustly measurable if strategically indistinguishable payoff types receive the same allocation. We show that ex post incentive compatibility and robust measurability are necessary and sufficient for robust virtual implementation.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Neeman, Z., 1998.
"The Relevance of Private Infromation in Mechanism Design,"
93, Boston University - Department of Economics.
- Neeman, Zvika, 2004. "The relevance of private information in mechanism design," Journal of Economic Theory, Elsevier, vol. 117(1), pages 55-77, July.
- Zvika Neeman, 1998. "The Relevance of Private Information in Mechanism Design," Papers 0093, Boston University - Industry Studies Programme.
- Matthew 0. Jackson, 1989.
"Implementation in Undominated Strategies - A Look at Bounded Mechanisms,"
833, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson, 1992. "Implementation in Undominated Strategies: A Look at Bounded Mechanisms," Review of Economic Studies, Oxford University Press, vol. 59(4), pages 757-775.
- Samet, Dov, 1998.
"Common Priors and Separation of Convex Sets,"
Games and Economic Behavior,
Elsevier, vol. 24(1-2), pages 172-174, July.
- Sefton, Martin & Yavas, Abdullah, 1996. "Abreu-Matsushima Mechanisms: Experimental Evidence," Games and Economic Behavior, Elsevier, vol. 16(2), pages 280-302, October.
- Kim-Sau Chung & Jeffrey C. Ely, 2000. "Efficient and Dominance Solvable Auctions with Interdependent Valuations," Discussion Papers 1313, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Morris, Stephen, 1994. "Trade with Heterogeneous Prior Beliefs and Asymmetric Information," Econometrica, Econometric Society, vol. 62(6), pages 1327-47, November.
- Georgy Artemov & Takashi Kunimoto & Roberto Serrano, 2007.
"Robust virtual implementation with incomplete information: Towards a reinterpretation of the Wilson doctrine,"
2007-14, Instituto Madrileño de Estudios Avanzados (IMDEA) Ciencias Sociales.
- Georgy Artemov & Takashi Kunimoto & Roberto Serrano, 2007. "Robust Virtual Implementation with Incomplete Information: Toward a Reinterpretation of the Wilson Doctrine," Working Papers 2007-6, Brown University, Department of Economics.
- Cremer, Jacques & McLean, Richard P, 1985. "Optimal Selling Strategies under Uncertainty for a Discriminating Monopolist When Demands Are Interdependent," Econometrica, Econometric Society, vol. 53(2), pages 345-61, March.
When requesting a correction, please mention this item's handle: RePEc:the:publsh:453. 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: (Martin J. Osborne)
If references are entirely missing, you can add them using this form.