Download Info

To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.

Publisher Info

Article provided by Elsevier in its journal Journal of Economic Theory.

Volume (Year): 28 (1982)
Issue (Month): 1 (October)
Pages: 1-18
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:eee:jetheo:v:28:y:1982:i:1:p:1-18

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/622869

For technical questions regarding this item, or to correct its listing, contact: (Heidi Boesdal).

Related research

Keywords:

Cited by:
(explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)

1. 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. [Downloadable!]
2. Kenneth R. Mount & Stanley Reiter, 1994. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Discussion Papers 1085, Northwestern University, Center for Mathematical Studies in Economics and Management Science. [Downloadable!]
   Other versions:
   • 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.
   • 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.
3. 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. [Downloadable!]
4. Lu Hong & Scott Page, 1994. "Reducing informational costs in endowment mechanisms," Review of Economic Design, Springer, vol. 1(1), pages 103-117, December. [Downloadable!] (restricted)
5. Peter J. Hammond, 1999. "Equal Rights to Trade and Mediate," Working Papers 99019, Stanford University, Department of Economics. [Downloadable!]
   Other versions:
   • Peter J. Hammond, 2003. "Equal rights to trade and mediate," Social Choice and Welfare, Springer, vol. 21(2), pages 181-193, October. [Downloadable!] (restricted)
6. Eric S. Maskin, 2008. "Mechanism Design: How to Implement Social Goals," Economics Working Papers 0081, Institute for Advanced Study, School of Social Science. [Downloadable!]
   Other versions:
   • Maskin, Eric S., 2007. "Mechanism Design: How to Implement Social Goals," Nobel Prize in Economics documents 2007-4, Nobel Prize Committee. [Downloadable!]
   • Eric S. Maskin, 2008. "Mechanism Design: How to Implement Social Goals," American Economic Review, American Economic Association, vol. 98(3), pages 567-76, June. [Downloadable!]
7. Scott E. Page, 1998. "Uncertainty, Difficulty, and Complexity," Research in Economics 98-08-076e, Santa Fe Institute. [Downloadable!]

Did you know? You can import bibliographic info in various formats into you bibliographic tool, or just into your word processor. See under "publisher info" on each abstract page.

This page was last updated on 2009-11-7.