A Theorem on Preference Aggregation
Abstract
I present a general theorem on preference aggregation. This theorem implies, as corollaries, Arrow's Impossibility Theorem, Wilson's extension of Arrow's to non-Paretian aggregation rules, the Gibbard-Satterthwaite Theorem and Sen's result on the Impossibility of a Paretian Liberal. The theorem shows that these classical results are not only similar, but actually share a common root. The theorem expresses a simple but deep fact that transcends each of its particular applications: it expresses the tension between decentralizing the choice of aggregate into partial choices based on preferences over pairs of alternatives, and the need for some coordination in these decisions, so as to avoid contradictory recommendations.Download Info
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.Bibliographic Info
Paper provided by Barcelona Graduate School of Economics in its series Working Papers with number 166.Length:
Date of creation: Jul 2003
Date of revision:
Handle: RePEc:bge:wpaper:166
Contact details of provider:
Postal: Ramon Trias Fargas, 25-27, 08005 Barcelona
Phone: +34 93 542-1222
Fax: +34 93 542-1223
Email:
Web page: http://www.barcelonagse.eu
More information through EDIRC
Related research
Keywords: NULL;Other versions of this item:
- Salvador Barberà, 2003. "A Theorem on Preference Aggregation," UFAE and IAE Working Papers 601.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
References
References listed on IDEASPlease 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.:
- Sen, Amartya Kumar, 1970. "The Impossibility of a Paretian Liberal," Scholarly Articles 3612779, Harvard University Department of Economics.
- Eliaz, K., 2001. "Arrow`s Theorem and the Gibbard-Satterthwaite Theorem as Special Cases of a Single Theorem," Papers 2001-11, Tel Aviv.
- Batteau, Pierre & Blin, Jean-Marie & Monjardet, Bernard, 1981. "Stability of Aggregation Procedures, Ultrafilters, and Simple Games," Econometrica, Econometric Society, vol. 49(2), pages 527-34, March.
- Reny, Philip J., 2001. "Arrow's theorem and the Gibbard-Satterthwaite theorem: a unified approach," Economics Letters, Elsevier, vol. 70(1), pages 99-105, January.
- 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).
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:bge:wpaper:166For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bruno Guallar).
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.