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.
Year of publication: |
1988
|
---|---|
Authors: | Reichelstein, Stefan ; Reiter, Stanley |
Published in: |
Econometrica. - Econometric Society. - Vol. 56.1988, 3, p. 661-92
|
Publisher: |
Econometric Society |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Game Forms with Minimal Strategy Spaces
Reichelstein, Stefan, (1985)
-
Game Forms with Minimal Strategy Spaces
Reichelstein, Stefan, (1985)
-
Game forms with minimal message spaces
Reichelstein, Stefan, (1988)
- More ...