Voting by committees under constraints
Many problems of social choice take the following form. There are n voters and a set of k objects. These objects may be bills considered by a legislature, candidates to some set of positions, or the collection of characteristics which distinguish a social alternative from another. The voters must choose a subset of the set of objects. Sometimes, any combination of objects is feasible: for example, if we consider the election of candidates to join a club which is ready to admit as many of them as the voters choose. It is for these cases that Barbera, Sonnenschein, and Zhou (1991) provided characterizations of all voting procedures which are strategy-proof and respect voter's sovereignty when voters' preferences are additively representable, and also when these are separable. For both of these restricted domains, voting by committees turns out to be the family of all rules satisfying the above requirements. Most often, though, some combinations of objects are not feasible, while others are: if there are more candidates than positions to be filled, only sets of size less than or equal to the available number of slots are feasible. Our purpose in this paper is to characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters' preferences are separable or additively representable. Our main conclusions are the following. First: all rules that satisfy strategy-proofness must still be voting by committees. Second: the committees for different objects must be interrelated, in precise ways which depend on what families of sets of objects are feasible. Third: unlike in Barbera, Sonnenschein, and Zhou (1991), the class of strategy- proof rules when preferences are additively representable can be substantially larger that the set of rules satisfying the same requirement when voter' preferences are separable.
(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.
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, 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, S. & Masso, J. & Serizawa, S., 1998.
"Strategy-Proof Voting on Compact Ranges,"
Games and Economic Behavior,
Elsevier, vol. 25(2), pages 272-291, November.
- Masso, J. & Barbera, S., 1996. "Strategy-Proof Voting on Compact Ranges," ASSET - Instituto De Economia Publica 156, ASSET (Association of Southern European Economic Theorists).
- Barbera, S & Masso, J & Serizawa, S, 1996. "Strategy-Proof Voting on Compact Ranges," UFAE and IAE Working Papers 358.96, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- 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).
- Barbera, Salvador & Masso, Jordi & Neme, Alejandro, 1997.
"Voting under Constraints,"
Journal of Economic Theory,
Elsevier, vol. 76(2), pages 298-321, October.
- Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990.
"Voting by Committees,"
Cowles Foundation Discussion Papers
941, Cowles Foundation for Research in Economics, Yale University.
- ASWAL, Navin & CHATTERJI, Shurojit & SEN, Arunava, 1999.
CORE Discussion Papers
1999040, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:122:y:2005:i:2:p:185-205. 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 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.