Can we identify Walrasian allocations?
Antonio Manresa
Review of Economic Design, 2002, vol. 7, issue 1, 57-73
Abstract:
We consider a discrete time, pure exchange infinite horizon economy with $ n\geq 2$ consumers and $\ell \geq 1$ consumption goods per period. Within the framework of decentralized mechanisms, we show that for any given consumption trade at any period of time, say at time one, the consumers will need in general an infinite dimensional (informational) space to identify such a trade as an intertemporal Walrasian one. However, we show a set of environments where the Walrasian trades at each period of time can be achieved as the equilibrium trades of a sequence of decentralized competitive mechanisms, using only both current prices and quantities to coordinate decisions.
Keywords: Walrasian allocation; informational decentralization; mechanism design (search for similar items in EconPapers)
JEL-codes: D51 D91 (search for similar items in EconPapers)
Date: 2002-09-05
Note: Received: 1 December 1999 / Accepted: 31 October 2000
References: Add references at CitEc
Citations:
Downloads: (external link)
http://link.springer.de/link/service/journals/10058/papers/2007001/20070057.pdf (application/pdf)
Access to the full text of the articles in this series is restricted
Related works:
Working Paper: Can we identify Walrasian allocations? (1998) 
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:spr:reecde:v:7:y:2002:i:1:p:57-73
Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/10058
Access Statistics for this article
Review of Economic Design is currently edited by Atila Abdulkadiroglu, Fuhito Kojima and Tilman Börgers
More articles in Review of Economic Design from Springer, Society for Economic Design
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().