Central European Journal of Operations Research

, Volume 25, Issue 4, pp 879–888 | Cite as

Optimal partisan districting on planar geographies

Original Paper

Abstract

We show that optimal partisan districting and majority securing districting in the plane with geographical constraints are NP-complete problems. We provide a polynomial time algorithm for determining an optimal partisan districting for a simplified version of the problem. In addition, we give possible explanations for why finding an optimal partisan districting for real-life problems cannot be guaranteed.

Keywords

Gerrymandering Computational complexity Dynamic programming Polyominoes Pack and crack 

References

  1. Altman M (1997) Is automation the answer? the computational complexity of automated redistricting. Rutgers Comput Law Technol J 23:81–142Google Scholar
  2. Altman M, McDonald M (2010) The promise and perils of computers in redistricting. Duke J Const L & Pub Pol’y 5:69–112Google Scholar
  3. Bação F, Lobo V, Painho M (2005) Applying genetic algorithms to zone design. Soft Comput 9:341–348CrossRefGoogle Scholar
  4. Bozkaya B, Erkut E, Laporte G (2003) A tabu search heuristic and adaptive memory procedure for political districting. Eur J Oper Res 144:12–26CrossRefGoogle Scholar
  5. Chou C-I, Li SP (2006) Taming the gerrymander-statistical physics approach to political districting problem. Phys A 369:799–808CrossRefGoogle Scholar
  6. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman and Company, San FranciscoGoogle Scholar
  7. Garfinkel RS, Nemhauser GL (1970) Optimal political districting by implicit enumeration techniques. Manag Sci 16:495–508CrossRefGoogle Scholar
  8. Hess SW, Weaver JB, Siegfeldt HJ, Whelan JN, Zitlau PA (1965) Nonpartisan political redistricting by computer. Oper Res 13:998–1006CrossRefGoogle Scholar
  9. Jensen I (2003) Counting polyominoes: a parallel implementation for cluster computing. In: Proceedings of the international conference on computational science, part III. (Lecture notes in computer science), vol 2659. Springer, Melbourne, pp 203–212Google Scholar
  10. Kalcsics J (2015) Districting problems. In: Laporte G, Nickel S, Saldanha da Gama F (eds) Location science. Springer, Berlin, pp 595–622Google Scholar
  11. Lewenberg Y, Lev O (2016) Divide and conquer: using geographic manipulation to win district-based elections. In: COMSOC-2016, Toulouse. https://www.irit.fr/COMSOC-2016/proceedings/LewenbergLevCOMSOC2016. Accessed 31 July 2016
  12. Mehrotra A, Johnson EL, Nemhauser GL (1998) An optimization based heuristic for political districting. Manag Sci 44:1100–1114CrossRefGoogle Scholar
  13. Nagel SS (1972) Computers and the law and politics of redistricting. Polity 5:77–93CrossRefGoogle Scholar
  14. Puppe C, Tasnádi A (2009) Optimal redistricting under geographical constraints: why ‘pack and crack’ does not work. Econ Lett 105:93–96CrossRefGoogle Scholar
  15. Ricca F, Simeone B (2008) Local search algorithms for political districting. Eur J Oper Res 189:1409–1426CrossRefGoogle Scholar
  16. Ricca F, Scozzari A, Simeone B (2008) Weighted Vornoi region algorithms for political districting. Math Comput Model 48:1468–1477CrossRefGoogle Scholar
  17. Ricca F, Scozzari A, Simeone B (2011) Political districting: from classical models to recent approaches. 4OR-Q J Oper Res 9:223–254Google Scholar
  18. Tasnádi A (2011) The political districting problem: a survey. Soc Econ 33:543–553Google Scholar
  19. Vickrey W (1961) On the prevention of gerrymandering. Polit Sci Q 76:105–110CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Balázs Fleiner
    • 1
  • Balázs Nagy
    • 1
  • Attila Tasnádi
    • 2
  1. 1.Department of MathematicsCorvinus University of BudapestBudapestHungary
  2. 2.MTA-BCE “Lendület” Strategic Interactions Research Group, Department of MathematicsCorvinus University of BudapestBudapestHungary

Personalised recommendations