### Abstract

We initiate the systematic algorithmic study for gerrymandering over graphs that was recently introduced by Cohen-Zemach, Lewen-berg and Rosenschein. Namely, we study a strategic procedure for a political districting designer to draw electoral district boundaries so that a particular target candidate can win in an election. We focus on the existence of such a strategy under the plurality voting rule, and give interesting contrasts which classify easy and hard instances with respect to polynomial-time solvability. For example, we prove that the problem for trees is strongly NP-complete (thus unlikely to have a pseudo-polynomial-time algorithm), but has a pseudo-polynomial-time algorithm when the number of candidates is constant. Another example is to prove that the problem for complete graphs is NP-complete when the number of electoral districts is two, while is solvable in polynomial time when it is more than two.

Original language | English |
---|---|

Title of host publication | 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 |

Publisher | International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) |

Pages | 1413-1421 |

Number of pages | 9 |

ISBN (Electronic) | 9781510892002 |

Publication status | Published - 2019 Jan 1 |

Event | 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 - Montreal, Canada Duration: 2019 May 13 → 2019 May 17 |

### Publication series

Name | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
---|---|

Volume | 3 |

ISSN (Print) | 1548-8403 |

ISSN (Electronic) | 1558-2914 |

### Conference

Conference | 18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 |
---|---|

Country | Canada |

City | Montreal |

Period | 19/5/13 → 19/5/17 |

### Keywords

- Computational social choice
- Gerrymandering
- Graph algorithms

### ASJC Scopus subject areas

- Artificial Intelligence
- Software
- Control and Systems Engineering

## Fingerprint Dive into the research topics of 'Algorithms for gerrymandering over graphs'. Together they form a unique fingerprint.

## Cite this

*18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019*(pp. 1413-1421). (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS; Vol. 3). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).