TY - JOUR AU - Gilbert, Hugo AU - Portoleau, Tom AU - Spanjaard, Olivier PY - 2020/04/03 Y2 - 2024/03/28 TI - Beyond Pairwise Comparisons in Social Choice: A Setwise Kemeny Aggregation Problem JF - Proceedings of the AAAI Conference on Artificial Intelligence JA - AAAI VL - 34 IS - 02 SE - AAAI Technical Track: Game Theory and Economic Paradigms DO - 10.1609/aaai.v34i02.5569 UR - https://ojs.aaai.org/index.php/AAAI/article/view/5569 SP - 1982-1989 AB - <p>In this paper, we advocate the use of setwise contests for aggregating a set of input rankings into an output ranking. We propose a generalization of the Kemeny rule where one minimizes the number of <em>k</em>-wise disagreements instead of pairwise disagreements (one counts 1 disagreement each time the top choice in a subset of alternatives of cardinality at most <em>k</em> differs between an input ranking and the output ranking). After an algorithmic study of this <em>k</em>-wise Kemeny aggregation problem, we introduce a <em>k</em>-wise counterpart of the majority graph. It reveals useful to divide the aggregation problem into several sub-problems. We conclude with numerical tests.</p> ER -