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").

MoreLess

Year of publication:	2009
Authors:	Puppe, Clemens ; Tasnádi, Attila
Publisher:	Elsevier
Subject:	Mathematics \| Econometrics

freely available

Full text |

More access options

unipub.lib.uni-corvinus.hu

linkinghub.elsevier.com

Check Google Scholar

I need help

More details

Type of publication:	Article
Language:	English
Notes:	Puppe, Clemens and Tasnádi, Attila (2009) Optimal redistricting under geographical constraints: Why "pack and crack" does not work. Economics Letters, 105 (1). pp. 93-96. DOI 10.1016/j.econlet.2009.06.008 <https://doi.org/10.1016/j.econlet.2009.06.008>
Source:	BASE

Persistent link: https://www.econbiz.de/10010124293