The competitive allocation process is informationally efficient uniquely
AbstractNo abstract is available for this item.
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 Elsevier in its journal Journal of Economic Theory.
Volume (Year): 28 (1982)
Issue (Month): 1 (October)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Eric S. Maskin, 2008.
"Mechanism Design: How to Implement Social Goals,"
American Economic Review,
American Economic Association, vol. 98(3), pages 567-76, June.
- Wellman, Michael P. & Walsh, William E. & Wurman, Peter R. & MacKie-Mason, Jeffrey K., 2001. "Auction Protocols for Decentralized Scheduling," Games and Economic Behavior, Elsevier, vol. 35(1-2), pages 271-303, April.
- 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.
- Alan Kirman, 2006.
"Demand Theory and General Equilibrium: From Explanation to Introspection, a Journey down the Wrong Road,"
History of Political Economy,
Duke University Press, vol. 38(5), pages 246-280, Supplemen.
- Alan Kirman, 2006. "Demand Theory and General Equilibrium: From Explanation to Introspection, a Journey down the Wrong Road," Economics Working Papers 0073, Institute for Advanced Study, School of Social Science.
- Kenneth R. Mount & Stanley Reiter, 1994.
"A Lower Bound on Computational Complexity Given by Revelation Mechanisms,"
1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- 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, 1996. "A lower bound on computational complexity given by revelation mechanisms (*)," Economic Theory, Springer, vol. 7(2), pages 237-266.
- Rebelo, S., 1997. "On the Determinant of Economic Growth," RCER Working Papers 443, University of Rochester - Center for Economic Research (RCER).
- Peter J. Hammond, 1999.
"Equal Rights to Trade and Mediate,"
99019, Stanford University, Department of Economics.
- Tian, Guoqiang & Li, Qi, 1995. "Ratio-Lindahl equilibria and an informationally efficient and implementable mixed-ownership system," Journal of Economic Behavior & Organization, Elsevier, vol. 26(3), pages 391-411, May.
- 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.
- Lu Hong & Scott Page, 1994. "Reducing informational costs in endowment mechanisms," Review of Economic Design, Springer, vol. 1(1), pages 103-117, December.
- Scott E. Page, 1998. "Uncertainty, Difficulty, and Complexity," Research in Economics 98-08-076e, Santa Fe Institute.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If references are entirely missing, you can add them using this form.