Reducing informational costs in endowment mechanisms
No abstract is available for this item.
Volume (Year): 1 (1994)
Issue (Month): 1 (December)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/10058/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- Jordan, J. S., 1982. "The competitive allocation process is informationally efficient uniquely," Journal of Economic Theory, Elsevier, vol. 28(1), pages 1-18, October.
- 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.
- 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.
- Kenneth Mount & Stanley Reiter, 1973.
"The Informational Size of Message Spaces,"
3, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Postlewaite, Andrew, 1979. "Manipulation via Endowments," Review of Economic Studies, Wiley Blackwell, vol. 46(2), pages 255-62, April.
When requesting a correction, please mention this item's handle: RePEc:spr:reecde:v:1:y:1994:i:1:p:103-117. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.