Game Forms with Minimal Message Spaces
AbstractThis paper is concerned with the amount of communication that must be provided to implement a performance standard by a mechanism whose stationary messages have the Nash property. In p articular, the authors study implementation of Walrasian allocations in exchange environments. They show that the smallest message space t hat implements Walrasian allo-cations is one of dimension, roughly, n E (. 1 1)& ./(n 1 1), where . is the number of commodities and n the number of agents. The authors exhibit an implementing mechanism whos e message space has that dimension. Copyright 1988 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): 56 (1988)
Issue (Month): 3 (May)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Kenneth R. Mount & Stanley Reiter, 1996.
"A lower bound on computational complexity given by revelation mechanisms (*),"
Springer, vol. 7(2), pages 237-266.
- Mount, Kenneth R & Reiter, Stanley, 1996. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Economic Theory, Springer, vol. 7(2), pages 237-66, February.
- Kenneth R. Mount & Stanley Reiter, 1994. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Discussion Papers 1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Eric Maskin & Tomas Sjostrom, 2001.
Economics Working Papers
0006, Institute for Advanced Study, School of Social Science.
- Saijo, Tatsuyoshi & Tatamitani, Yoshikatsu & Yamato, Takehiko, 1996. "Toward Natural Implementation," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 37(4), pages 949-80, November.
- Ilya Segal, 2004. "The Communication Requirements of of Social Choice Rules and Supporting Budget Sets," Economics Working Papers 0039, Institute for Advanced Study, School of Social Science.
- Thomson, William, 2005.
Games and Economic Behavior,
Elsevier, vol. 52(1), pages 186-200, July.
- Healy, Paul J. & Mathevet, Laurent, 2012. "Designing stable mechanisms for economic environments," Theoretical Economics, Econometric Society, vol. 7(3), September.
- Bhaskar Dutta & Arunava Sen & Rajiv Vohra, 1994. "Nash implementation through elementary mechanisms in economic environments," Review of Economic Design, Springer, vol. 1(1), pages 173-203, December.
- L. Hurwicz & S. Reiter, 1997. "On Transversals and Systems of Distinct Representatives," Discussion Papers 1176R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Arya, Anil & Mittendorf, Brian, 2005. "Using disclosure to influence herd behavior and alter competition," Journal of Accounting and Economics, Elsevier, vol. 40(1-3), pages 231-246, December.
- J. Jordan, 2009. "Communication complexity and stability of equilibria in economies and games," Review of Economic Design, Springer, vol. 13(1), pages 115-135, April.
- Bernarda Zamora & Pablo Amorós, 1998. "- Implementation Of Optimal Contracts Under Adverse Selection," Working Papers. Serie AD 1998-25, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Segal, Ilya, 2007. "The communication requirements of social choice rules and supporting budget sets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 341-378, September.
- Leonid Hurwicz, 1994. "Economic design, adjustment processes, mechanisms, and institutions," Review of Economic Design, Springer, vol. 1(1), pages 1-14, December.
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.