Optimal redistricting under geographical constraints: Why 'pack and crack' does not work

摘要

We show that optimal partisan redistricting with geographical constraints is a computationally intractable (NP-complete) problem. In particular, even when voter's preferences are deterministic, a solution is generally not obtained by concentrating opponent's supporters in "unwinnable" districts ("packing") and spreading one's own supporters evenly among the other districts in order to produce many slight marginal wins ("cracking").