District-based elections, in which voters vote for a district representative and those representatives ultimately choose the winner, are vulnerable to gerrymandering, i.e., manipu-lation of the outcome by changing the location and borders of districts. Many countries aim to limit blatant gerrymandering, and thus we introduce a geographically-based manipulation problem, where voters must vote at the ballot box closest to them. We show that this problem is NP-completc in the worst case. However, we present a greedy algorithm for the problem; testing it both on simulation data as well as on real- world data from the 2015 Israeli and British elections, we show that many parties are potentially able to make themselves victorious using district manipulation. Moreover, we show that the relevant variables here go beyond share of the vote; the form of geographic dispersion also plays a crucial role.
|Original language||American English|
|Title of host publication||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017|
|Editors||Edmund Durfee, Sanmay Das, Kate Larson, Michael Winikoff|
|Publisher||International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)|
|Number of pages||9|
|State||Published - 2017|
|Event||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017 - Sao Paulo, Brazil|
Duration: 8 May 2017 → 12 May 2017
|Name||Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS|
|Conference||16th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2017|
|Period||8/05/17 → 12/05/17|
Bibliographical notePublisher Copyright:
© Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All Rights Reserved.