{"type":"ScholarlyArticle","title":"Kemeny Elections with Bounded Single-Peaked or Single-Crossing Width","authors":[{"name":"Denis Cornaz","slug":"denis-cornaz","given":"Denis","family":"Cornaz","affiliation":""},{"name":"Lucie Galand","slug":"lucie-galand","given":"Lucie","family":"Galand","affiliation":""},{"name":"Olivier Spanjaard","slug":"olivier-spanjaard","given":"Olivier","family":"Spanjaard","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/23","pdf":"https://ijcai.org/proceedings/2013/0023.pdf","markdown":"https://ijcai.org/proceedings/2013/23.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/23","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":23,"pages":{"first":76,"last":81},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}