---
title: "The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)"
authors:
  - "Piotr Faliszewski"
  - "Edith Hemaspaandra"
  - "Lane A. Hemaspaandra"
doi: ""
url: "https://ijcai.org/proceedings/2015/591"
pdf: "https://ijcai.org/proceedings/2015/0591.pdf"
venue: "Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence"
year: 2015
pages: "4178-4181"
track: "Journal Track"
keywords:
---

# The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)

Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra

*Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence*, pages 4178-4181.

## 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.