Strategy-proof allocation of multiple public goods
We characterize the set of strategy-proof social choice functions (SCFs), the outcome of which are multiple public goods. The set of feasible alternatives is a subset of a product set with a finite number of elements. We do not require the SCFs to be ‘onto’, but instead impose the weaker requirement that every element in each category of public goods is attained at some preference profile. Admissible preferences are arbitrary rankings of the goods in the various categories, while a separability restriction concerning preferences among the various categories is assumed. We find that the range of the SCF is uniquely decomposed into a product set in general coarser than the original product set, and that the SCF must be dictatorial in each component of the range. If the range cannot be decomposed at all, the SCF is dictatorial in spite of the separability assumption on preferences, and a form of the Gibbard-Satterthwaite theorem with a restricted preference domain is obtained.
(This abstract was borrowed from another version of 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): 30 (2008)
Issue (Month): 2 (February)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00355/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- Barbera, Salvador & Sonnenschein, Hugo & Zhou, Lin, 1991.
"Voting by Committees,"
Econometric Society, vol. 59(3), pages 595-609, May.
- Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990. "Voting by Committees," Cowles Foundation Discussion Papers 941, Cowles Foundation for Research in Economics, Yale University.
- Barbera, S. & Sonnenschein, H., 1988. "Voting By Quota And Committee," UFAE and IAE Working Papers 95-88, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Le Breton, M. & Sen, A., 1995. "Strategyproofness and decomposability : Weak Orderings," G.R.E.Q.A.M. 95a38, Universite Aix-Marseille III.
- G. Chichilnisky & G. M. Heal, 1997.
"The geometry of implementation: a necessary and sufficient condition for straightforward games (*),"
Social Choice and Welfare,
Springer, vol. 14(2), pages 259-294.
- Heal, G.M. & Chichilnisky, G., 1995. "The Geometry of Implementation: A Necessary and Sufficient Condition for Straightforward Games," Papers 95-22, Columbia - Graduate School of Business.
- Masso, J. & Barbera, S., 1996.
"Strategy-Proof Voting on Compact Ranges,"
ASSET - Instituto De Economia Publica
156, ASSET (Association of Southern European Economic Theorists).
- Sen, Amartya Kumar, 1970. "The Impossibility of a Paretian Liberal," Scholarly Articles 3612779, Harvard University Department of Economics.
- Barbera, S. & Gul, F. & Stacchetti, E., 1992.
"Generalized Median Voter Schemes and Committees,"
UFAE and IAE Working Papers
184.92, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Barbera, Salvador & Masso, Jordi & Neme, Alejandro, 1997.
"Voting under Constraints,"
Journal of Economic Theory,
Elsevier, vol. 76(2), pages 298-321, October.
- Yves Sprumont, 1995. "Strategyproof Collective Choice in Economic and Political Environments," Canadian Journal of Economics, Canadian Economics Association, vol. 28(1), pages 68-107, February.
- Barbera, S. & Peleg, B., 1988. "Strategy-Proof Voting Schemes With Continuous Preferences," UFAE and IAE Working Papers 91.88, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Navin Aswal & Shurojit Chatterji & Arunava Sen, 2003.
Springer, vol. 22(1), pages 45-62, 08.
- Le Breton, Michel & Weymark, John A., 1999. "Strategy-proof social choice with continuous separable preferences," Journal of Mathematical Economics, Elsevier, vol. 32(1), pages 47-85, August.
- 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..
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:30:y:2008:i:2:p:181-196. 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: (Guenther Eichhorn)or (Christopher F Baum)
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.