The communication requirements of social choice rules and supporting budget sets
No abstract is available for this item.
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.:
- Sato, Fumitaka, 1981. "On the informational size of message spaces for resource allocation processes in economies with public goods," Journal of Economic Theory, Elsevier, vol. 24(1), pages 48-69, February.
- Sen, Amartya, 1970. "The Impossibility of a Paretian Liberal," Journal of Political Economy, University of Chicago Press, vol. 78(1), pages 152-57, Jan.-Feb..
- Mas-Colell, Andreu & Whinston, Michael D. & Green, Jerry R., 1995. "Microeconomic Theory," OUP Catalogue, Oxford University Press, number 9780195102680.
- Moulin, H. & Peleg, B., 1982.
"Cores of effectivity functions and implementation theory,"
Journal of Mathematical Economics,
Elsevier, vol. 10(1), pages 115-145, June.
- Moulin, Hervé & Peleg, B., 1982. "Cores of effectivity functions and implementation theory," Economics Papers from University Paris Dauphine 123456789/13220, Paris Dauphine University.
- Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
- Kenneth Mount & Stanley Reiter, 1973.
"The Informational Size of Message Spaces,"
3, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- John William Hatfield & Paul R. Milgrom, 2005.
"Matching with Contracts,"
American Economic Review,
American Economic Association, vol. 95(4), pages 913-935, September.
- McLean, Richard P. & Postlewaite, Andrew, 1989. "Excess functions and nucleolus allocations of pure exchange economies," Games and Economic Behavior, Elsevier, vol. 1(2), pages 131-143, June.
- Echenique, Federico, 2004.
"Counting Combinatoral Choice Rules,"
1199, California Institute of Technology, Division of the Humanities and Social Sciences.
- Serrano, Roberto & Volij, Oscar, 2000.
"Walrasian Allocations without Price-Taking Behavior,"
Journal of Economic Theory,
Elsevier, vol. 95(1), pages 79-106, November.
- Volij, Oscar & Serrano, Roberto, 2000. "Walrasian Allocations Without Price-Taking Behavior," Staff General Research Papers 5168, Iowa State University, Department of Economics.
- Reichelstein, Stefan, 1984. "Incentive compatibility and informational requirements," Journal of Economic Theory, Elsevier, vol. 34(1), pages 32-51, October.
- Calsamiglia, Xavier, 1977. "Decentralized resource allocation and increasing returns," Journal of Economic Theory, Elsevier, vol. 14(2), pages 263-283, April.
- Bikhchandani, Sushil & Mamer, John W., 1997. "Competitive Equilibrium in an Exchange Economy with Indivisibilities," Journal of Economic Theory, Elsevier, vol. 74(2), pages 385-413, June.
- Sen, Amartya Kumar, 1970. "The Impossibility of a Paretian Liberal," Scholarly Articles 3612779, Harvard University Department of Economics.
- 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.
- Milleron, Jean-Claude, 1972. "Theory of value with public goods: A survey article," Journal of Economic Theory, Elsevier, vol. 5(3), pages 419-477, December.
- Mas-Colell, Andreu, 1980. "Efficiency and Decentralization in the Pure Theory of Public Goods," The Quarterly Journal of Economics, MIT Press, vol. 94(4), pages 625-41, June.
- Sotomayor, Marilda, 1999. "Three remarks on the many-to-many stable matching problem," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 55-70, July.
- Reichelstein, Stefan & Reiter, Stanley, 1988. "Game Forms with Minimal Message Spaces," Econometrica, Econometric Society, vol. 56(3), pages 661-92, May.
- Jordan, J. S., 1982. "The competitive allocation process is informationally efficient uniquely," Journal of Economic Theory, Elsevier, vol. 28(1), pages 1-18, October.
- Bhaskar Dutta & Arunava Sen & Rajiv Vohra, 1994. "Nash implementation through elementary mechanisms in economic environments," Review of Economic Design, Springer, vol. 1(1), pages 173-203, December.
- Maskin, Eric, 1999.
"Nash Equilibrium and Welfare Optimality,"
Review of Economic Studies,
Wiley Blackwell, vol. 66(1), pages 23-38, January.
- Eric Maskin, 1998. "Nash Equilibrium and Welfare Optimality," Harvard Institute of Economic Research Working Papers 1829, Harvard - Institute of Economic Research.
- Guoqiang Tian, 2004. "A Unique Informationally Efficient Allocation Mechanism In Economies With Consumption Externalities," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(1), pages 79-111, 02.
- Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
- Williams, Steven R, 1986. "Realization and Nash Implementation: Two Aspects of Mechanism Design," Econometrica, Econometric Society, vol. 54(1), pages 139-51, January.
- Kannai, Yakar, 1970. "Continuity Properties of the Core of a Market," Econometrica, Econometric Society, vol. 38(6), pages 791-815, November.
- Hurwicz,Leonid & Reiter,Stanley, 2006.
"Designing Economic Mechanisms,"
Cambridge University Press, number 9780521836418.
- Takashi Ishikida & Thomas Marschak, 1996. "Mechanisms that efficiently verify the optimality of a proposed action," Review of Economic Design, Springer, vol. 2(1), pages 33-68, December.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:136:y:2007:i:1:p:341-378. 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: (Zhang, Lei)
If references are entirely missing, you can add them using this form.