Reducing informational costs in endowment mechanisms
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.
Volume (Year): 1 (1994)
Issue (Month): 1 (December)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/journal/10058|
References listed on IDEAS
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.:
- Andrew Postlewaite, 1979. "Manipulation via Endowments," Review of Economic Studies, Oxford University Press, vol. 46(2), pages 255-262.
- Jordan, J. S., 1982. "The competitive allocation process is informationally efficient uniquely," Journal of Economic Theory, Elsevier, vol. 28(1), pages 1-18, October.
- Mount, Kenneth & Reiter, Stanley, 1974.
"The informational size of message spaces,"
Journal of Economic Theory,
Elsevier, vol. 8(2), pages 161-192, June.
- Kenneth Mount & Stanley Reiter, 1973. "The Informational Size of Message Spaces," Discussion Papers 3, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Saijo, Tatsuyoshi, 1988. "Strategy Space Reduction in Maskin's Theorem: Sufficient Conditions for Nash Implementation," Econometrica, Econometric Society, vol. 56(3), pages 693-700, May.
- McKelvey, Richard D. & Niemi, Richard G., 1978. "A multistage game representation of sophisticated voting for binary procedures," Journal of Economic Theory, Elsevier, vol. 18(1), pages 1-22, June. Full references (including those not matched with items on IDEAS)