Proceedings

Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 76-81.

Abstract

This paper is devoted to complexity results regarding specific measures of proximity to single-peakedness and single-crossingness, called single-peaked width [Cornaz et al., 2012] and single-crossing width. Thanks to the use of the PQ-tree data structure [Booth and Lueker, 1976], we show that both problems are polynomial time solvable in the general case (while it was only known for single-peaked width and in the case of narcissistic preferences). Furthermore, we establish one of the first results (to our knowledge) concerning the effect of nearly single-peaked electorates on the complexity of an NP-hard voting system, namely we show the fixed-parameter tractability of Kemeny elections with respect to the parameters single-peaked width and single-crossing width.

Denis Cornaz, Lucie Galand, and Olivier Spanjaard. 2013. Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13. IJCAI, 76–81. https://ijcai.org/proceedings/2013/23
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards