This paper proposes a general framework for analyzing a class of functions called social aggregators, which map profiles of linear orders to a set of binary relations. This class of aggregators includes aggregators that yield a preference relation (social welfare functions) and those which yield a choice of an alternative (social choice functions). Equipped with this framework, I identify a property called Preference Reversal (PR) such that any Pareto efficient aggregator having this property must be dictatorial. This allows me to state a general impossibility theorem, which includes Arrow’s Theorem and the Gibbard Satterthwaite Theorem as two special examples. Furthermore, I show that monotonicity and IIA are closely linked, by demonstrating that both are actually special cases of PR in specific environments. Copyright Springer-Verlag 2004
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): 22 (2004)
Issue (Month): 2 (04)
|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|
When requesting a correction, please mention this item's handle: RePEc:spr:sochwe:v:22:y:2004:i:2:p:317-330. 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 references are entirely missing, you can add them using this form.