Skip to Main content Skip to Navigation
Conference papers

Kemeny Elections with Bounded Single-peaked or Single-crossing Width

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".
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Christine Okret-Manville <>
Submitted on : Friday, October 21, 2016 - 10:37:28 AM
Last modification on : Thursday, January 21, 2021 - 11:38:01 AM
Long-term archiving on: : Friday, February 3, 2017 - 12:49:03 PM


Publisher files allowed on an open archive


  • HAL Id : hal-01372505, version 1


Denis Cornaz, Lucie Galand, Olivier Spanjaard. Kemeny Elections with Bounded Single-peaked or Single-crossing Width. 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), Aug 2013, Beijing, China. pp.76-82. ⟨hal-01372505⟩



Record views


Files downloads