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
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
For technical questions regarding this item, or to correct its listing, contact: (Christopher F Baum).
Related research
Keywords:
Cited by: (explanations, 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.)