Separability and aggregation of equivalence relations (Q453212)

This paper provides axiomatic characterizations of two families of rules for aggregating equivalence relations: the family of join aggregators and the family of meet aggregators. The central condition in these characterizations are two separability axioms. Disjunctive separability, neutrality, and unanimity characterize the family of join aggregators. Conjunctive separability and unanimity characterize the family of meet aggregators. This paper shows another characterization of the family of meet aggregators using conjunctive separability and two Pareto axioms, Pareto+ and Pareto-. If it drops Pareto-, then conjunctive separability and Pareto+ characterize the family of meet aggregators along with a trivial aggregator.