On the complexity of manipulating elections

Authors:
Tom Coleman;Vanessa Teague
Affiliations:
The University of Melbourne, Victoria;The University of Melbourne, Victoria
Venue:
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
Year:
2007

Citing 1
Cited 6

Complexity of manipulating elections with few candidates

Eighteenth national conference on Artificial intelligence

Where are the really hard manipulation problems? the phase transition in manipulating the veto rule

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An Empirical Study of the Manipulability of Single Transferable Voting

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Is computational complexity a barrier to manipulation?

Annals of Mathematics and Artificial Intelligence
Where are the hard manipulation problems?

Journal of Artificial Intelligence Research
Control complexity in bucklin, fallback, and plurality voting: an experimental approach

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the manipulation of voting schemes, where a voter lies about their preferences in the hope of improving the election's outcome. All voting schemes are potentially manipulable. However, some, such as the Single Transferable Vote (STV) scheme used in Australian elections, are resistant to manipulation because it is NP-hard to compute the manipulating vote(s). We concentrate on STV and some natural generalisations of it called Scoring Elimination Protocols. We show that the hardness result for STV is true only if both the number of voters and the number of candidates are unbounded---we provide algorithms for a manipulation if either of these is fixed. This means that manipulation would not be hard in practice when either number is small. Next we show that the weighted version of the manipulation problem is NP-hard for all Scoring Elimination Protocols except one, which we provide an algorithm for manipulating. Finally we experimentally test a heuristic for solving the manipulation problem and conclude that it would not usually be effective.