Many electoral systems around the world divide voters into districts.
The votes in each district are tallied separately, and each district elects a representative to a seat in a congressional system.
The adversarial manipulation of these districts to favor one political party over another is known as gerrymandering and has the potential to greatly skew elections.
Gerrymandering has been studied in various contexts, including political science [1]}, geography [2]}, and social networks [3]}, [4]}.
Many studies focus on the prevention of gerrymandering [5]} or calculate a fairness metric on real-world districts [6]}, [7]}, [8]}.
The increasing role of algorithms in the creation and evaluation of district maps [9]}, [10]} motivates the study of the computational complexity of gerrymandering problems.
