@article{Gilbert_Portoleau_Spanjaard_2020, title={Beyond Pairwise Comparisons in Social Choice: A Setwise Kemeny Aggregation Problem}, volume={34}, url={https://ojs.aaai.org/index.php/AAAI/article/view/5569}, DOI={10.1609/aaai.v34i02.5569}, abstractNote={<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>}, number={02}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Gilbert, Hugo and Portoleau, Tom and Spanjaard, Olivier}, year={2020}, month={Apr.}, pages={1982-1989} }