Game Forms with Minimal Message Spaces
This 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.
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.
Volume (Year): 56 (1988)
Issue (Month): 3 (May)
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/
More information through EDIRC
|Order Information:|| Web: https://www.econometricsociety.org/publications/econometrica/access/ordering-back-issues Email: |
When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:56:y:1988:i:3:p:661-92. 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: (Wiley-Blackwell Digital Licensing)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.