Optimal redistricting under geographical constraints: Why “pack and crack” does not work |
| |
| Authors: | Clemens Puppe Attila Tasndi |
| |
| Institution: | aDepartment of Economics, University of Karlsruhe, D – 76128 Karlsruhe, Germany;bDepartment of Mathematics, Corvinus University of Budapest, H – 1093 Budapest, Fővám tér 8, Hungary |
| |
| Abstract: | 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”). |
| |
| Keywords: | Districting Gerrymandering NP-complete problems |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
