A robustness result for rationalizable implementation
This paper investigates the extent to which rationalizable implementation depends on the implicit common knowledge restrictions usually embodied in traditional models. It is shown that under fairly general conditions such restrictions are without loss of generality in the following sense: If a mechanism implements a social choice function f on a type space X, then implements f assuming only that the agents' k-order beliefs are among those described by an open set B containing X, while higher-order beliefs are completely unrestricted. The result is applied to direct implementation on payoff type spaces, and related to the weak (incentive compatible) implementation problem.
If 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.
References listed on IDEAS
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.:
- 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.
- Dirk Bergemann & Stephen Morris, 2005.
"Robust Mechanism Design,"
Econometric Society, vol. 73(6), pages 1771-1813, November.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Cowles Foundation Discussion Papers 1421, Cowles Foundation for Research in Economics, Yale University.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Cowles Foundation Discussion Papers 1421R, Cowles Foundation for Research in Economics, Yale University, revised Apr 2004.
- Stephen Morris & Dirk Bergemann, 2004. "Robust Mechanism Design," Yale School of Management Working Papers ysm380, Yale School of Management.
- Dirk Bergemann & Stephen Morris, 2003. "Robust Mechanism Design," Levine's Bibliography 666156000000000035, UCLA Department of Economics.
- Dirk Bergemann & Stephen Morris, 2005. "Robust Mechanism Design," NajEcon Working Paper Reviews 666156000000000593, www.najecon.org.
- Jonathan Weinstein & Muhamet Yildiz, 2007. "A Structure Theorem for Rationalizability with Application to Robust Predictions of Refinements," Econometrica, Econometric Society, vol. 75(2), pages 365-400, 03.
- Marion Oury & Olivier Tercieux, 2009.
Economics Working Papers
0090, Institute for Advanced Study, School of Social Science.
- Morris, Stephen & Dekel, Eddie & Fudenberg, Drew, 2007.
"Interim Correlated Rationalizability,"
3196333, Harvard University Department of Economics.
- Bergemann, Dirk & Stephen Morris, 2006.
"Robust Implementation in Direct Mechanisms,"
Cowles Foundation Discussion Papers
1561R2, Cowles Foundation for Research in Economics, Yale University, revised Jan 2009.
- Bergemann, Dirk & Morris, Stephen, 2009.
"Robust virtual implementation,"
Econometric Society, vol. 4(1), March.
- Dirk Bergemann & Stephen Morris, 2009. "Robust Virtual Implementation," Levine's Working Paper Archive 814577000000000155, David K. Levine.
- Dirk Bergemann & Stephen Morris, 2007. "Robust Virtual Implementation," Cowles Foundation Discussion Papers 1609R2, Cowles Foundation for Research in Economics, Yale University, revised Jan 2009.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:72:y:2011:i:1:p:301-305. 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: (Dana Niculescu)
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.