Separability and aggregation of equivalence relations
- 222 Downloads
We provide axiomatic characterizations of two natural families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central conditions in these characterizations are two separability axioms. Disjunctive separability, neutrality, and unanimity characterize the family of join aggregators. On the other hand, conjunctive separability and unanimity characterize the family of meet aggregators. We show another characterization of the family of meet aggregators using conjunctive separability and two Pareto axioms, Pareto+ and Pareto−. If we drop Pareto−, then conjunctive separability and Pareto+ characterize the family of meet aggregators along with a trivial aggregator.
KeywordsAggregation Equivalence relations Separability Unanimity Pareto axiom
JEL ClassificationC0 D0
Unable to display preview. Download preview PDF.
- Ahn, D.S., Chambers C.P.: What’s on the menu? Deciding what is available to the group? Working paper. University of California, Berkeley (2010)Google Scholar
- Arrow K.J.: Social Choice and Individual Values. pp. 1963, 2nd edn. Wiley, New York (1951)Google Scholar
- Dimitrov D., Puppe C.: Note on non-bossy social classification, working paper. Karlsruhe Institute of Technology, Karlsruhe (2010)Google Scholar
- Kasher A., Rubinstein A.: On the question “Who is a J?” a social choice approach. Logique et Analyse 160, 385–395 (1997)Google Scholar
- Mirkin B.: On the problem of reconciling partitions. In: Blalock, H.M., Aganbegian, A., Borodkin, F., Boudon, R., Capecchi, V. (eds) Quantitative sociology, International Perspectives on Mathematical and Statistical Modelling, pp. 441–449. Academic Press, New York (1975)Google Scholar
- Shapley L.: Contributions to the theory of game II (Annals of mathematics studies 28). In: Kuhn, H.W., Tucker, A.W. (eds) chapter A Value for n-Person Games, pp. 307–317. Princeton University Press, Princeton (1953)Google Scholar