| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5061488 | Economics Letters | 2009 | 4 Pages |
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”).
Related Topics
Social Sciences and Humanities
Economics, Econometrics and Finance
Economics and Econometrics
Authors
Clemens Puppe, Attila Tasnádi,