Game Forms with Minimal Message Spaces

Stefan Reichelstein and Stanley Reiter

Econometrica, 1988, vol. 56, issue 3, 661-92

Abstract: 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.

Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://links.jstor.org/sici?sici=0012-9682%2819880 ... O%3B2-I&origin=repec full text (application/pdf)
Access to full text is restricted to JSTOR subscribers. See http://www.jstor.org for details.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ecm:emetrp:v:56:y:1988:i:3:p:661-92

Ordering information: This journal article can be ordered from
https://www.economet ... ordering-back-issues

Access Statistics for this article

Econometrica is currently edited by Guido Imbens

More articles in Econometrica from Econometric Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().