Incentive compatibility and informational requirements
No abstract is available for this item.
If 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.
- Calsamiglia, Xavier & Kirman, Alan, 1993.
"A Unique Informationally Efficient and Decentralized Mechanism with Fair Outcomes,"
Econometric Society, vol. 61(5), pages 1147-1172, September.
- Xavier Calsamiglia & Alan Kirman, 1991. "A unique informationally efficient and decentralized mechanism with fair outcomes," Economics Working Papers 7, Department of Economics and Business, Universitat Pompeu Fabra.
- Thierry Granger, 1997. "Le renouveau de la théorie des organisations. Lecture critique de trois ouvrages récents," Revue Économique, Programme National Persée, vol. 48(1), pages 147-180.
- Susan Athey & Ilya Segal, 2013. "An Efficient Dynamic Mechanism," Econometrica, Econometric Society, vol. 81(6), pages 2463-2485, November.
- Susan Athey & Ilya Segal, 2007. "An Efficient Dynamic Mechanism," Levine's Bibliography 122247000000001134, UCLA Department of Economics.
- 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.
- Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.
- Kenneth R. Mount & Stanley Reiter, 1996. "A lower bound on computational complexity given by revelation mechanisms (*)," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), 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;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266, February.
- 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.
- Jean-Jacques Laffont, 1987. "Le risque moral dans la relation de mandat," Revue Économique, Programme National Persée, vol. 38(1), pages 5-24.
- Fadel, Ronald & Segal, Ilya, 2009. "The communication cost of selfishness," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1895-1920, September.
- 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.
- Marschak, Thomas, 2006. "Organization Structure," MPRA Paper 81518, University Library of Munich, Germany.
- Nisan, Noam & Segal, Ilya, 2006. "The communication requirements of efficient allocations and supporting prices," Journal of Economic Theory, Elsevier, vol. 129(1), pages 192-224, July.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:34:y:1984:i:1:p:32-51. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Follow series, journals, authors & more
New papers by email
Subscribe to new additions to RePEc
Public profiles for Economics researchers
Various rankings of research in Economics & related fields
Who was a student of whom, using RePEc
Curated articles & papers on various economics topics
Upload your paper to be listed on RePEc and IDEAS
Blog aggregator for economics research
Cases of plagiarism in Economics
Job Market Papers
RePEc working paper series dedicated to the job market
Pretend you are at the helm of an economics department
Services from the StL Fed
Data, research, apps & more from the St. Louis Fed