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

Clemens Puppe and Attila Tasnádi ()

Economics Letters, 2009, vol. 105, issue 1, pages 93-96

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 (search for similar items in EconPapers)
Date: 2009

Downloads: (external link)
http://www.sciencedirect.com/science/article/B6V84 ... 0f445c51bb5db68bc384
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:eee:ecolet:v:105:y:2009:i:1:p:93-96

Access Statistics for this article

Economics Letters is edited by E. Maskin

More articles in Economics Letters from Elsevier
Series data maintained by Heidi Boesdal ().