Aggregation of binary evaluations: a Borda-like approach
- 279 Downloads
We characterize a rule for aggregating binary evaluations—equivalently, dichotomous weak orders—similar in spirit to the Borda rule from the preference aggregation literature. The binary evaluation framework was introduced as a general approach to aggregation by Wilson (J Econ Theory 10:89–99, 1975). In this setting we characterize the “mean rule,” which we derive from properties similar to those Young (J Econ Theory 9:43–52, 1974) used in his characterization of the Borda rule. Complementing our axiomatic approach is a derivation of the mean rule using vector decomposition methods that have their origins in Zwicker (Math Soc Sci 22:187–227, 1991). Additional normative appeal is provided by a form of tension minimization that characterizes the mean rule and suggests contexts wherein its application may be appropriate. Finally, we derive the mean rule from an approach to judgment aggregation recently proposed by Dietrich (Soc Choice Welf 42:873–911, 2014).
- Harary F (1958) Graph theory and electric networks. IRE Trans Circuit Theory CT-6:95-109Google Scholar
- Kasher A, Rubinstein A (1997) On the question “who is a J?”: a social choice approach. Logique et Analyse 160:385–395Google Scholar
- List C, Pettit P (2002) Aggregating sets of judgments: an impossibility result. Econ Philos 18:89–110Google Scholar
- Saari DG (2001b) Chaotic elections: a mathematician looks at voting. American Mathematical Society, ProvidenceGoogle Scholar
- Xia L (2011) Computational voting theory: game-theoretic and combinatorial aspects, Ph.D Dissertation. Computer Science Department, Duke University, Durham. http://www.cs.rpi.edu/~xial/