{"type":"ScholarlyArticle","title":"The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)","authors":[{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Edith Hemaspaandra","slug":"edith-hemaspaandra","given":"Edith","family":"Hemaspaandra","affiliation":""},{"name":"Lane A. Hemaspaandra","slug":"lane-a-hemaspaandra","given":"Lane A.","family":"Hemaspaandra","affiliation":""}],"abstract":"Many electoral control and manipulation problems — which we will refer to in general as manipulative actions problems — are NP-hard in the general case. Many of these problems fall into polynomial time if the electorate is single-peaked, i.e., is polarized along some axis/issue. However, real-world electorates are not truly single-peaked — for example, there may be some maverick voters — and to take this into account, we study the complexity of manipulative-action algorithms for the case of nearly single-peaked electorates.","doi":null,"url":"https://ijcai.org/proceedings/2015/591","pdf":"https://ijcai.org/proceedings/2015/0591.pdf","markdown":"https://ijcai.org/proceedings/2015/591.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/591","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Journal Track","track":"Journal Track","number":591,"pages":{"first":4178,"last":4181},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}