The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Journal Track. 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.
@inproceedings{ijcai2015p591,
title = {The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract)},
author = {Faliszewski, Piotr and Hemaspaandra, Edith and Hemaspaandra, Lane A.},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {4178--4181},
year = {2015},
month = {7},
note = {Journal Track},
url = {https://ijcai.org/proceedings/2015/591},
}
TY - CPAPER TI - The Complexity of Manipulative Attacks in Nearly Single-Peaked Electorates (Extended Abstract) AU - Faliszewski, Piotr AU - Hemaspaandra, Edith AU - Hemaspaandra, Lane A. T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 4178 EP - 4181 UR - https://ijcai.org/proceedings/2015/591 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
