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").
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Sherstyuk, Katerina, 1993.
"How to Gerrymander: A Formal Analysis,"
855, California Institute of Technology, Division of the Humanities and Social Sciences.
- Faruk Gul & Wolfgang Pesendorfer, 2010.
American Economic Review,
American Economic Association, vol. 100(4), pages 1616-41, September.
- John N. Friedman & Richard T. Holden, 2008. "Optimal Gerrymandering: Sometimes Pack, but Never Crack," American Economic Review, American Economic Association, vol. 98(1), pages 113-44, March.
- Gilligan, Thomas W & Matsusaka, John G, 1999. "Structural Constraints on Partisan Bias under the Efficient Gerrymander," Public Choice, Springer, vol. 100(1-2), pages 65-84, July.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:105:y:2009:i:1:p:93-96. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.