Toward a Talismanic Redistricting Tool: A Computational Method for Identifying Extreme Redistricting Plans

Abstract Partisan gerrymandering is widely frowned upon by the citizenry as well as the Supreme Court. Despite broad disdain for the practice, the Supreme Court has found it difficult to identify a workable standard by which we might regulate political gerrymandering. We have lacked sufficient tools to analyze and synthesize redistricting data, in part, because the requisite computation is massive. At the same time, the recent proliferation of significant computing power has led to the discovery of the extensive and often surprising reach of technology, information, and computation in many realms of life. Our capacities to compile, organize, analyze, and disseminate information have increased dramatically and facilitated the creation of many tools to connect citizens and automate human tasks. We present a computational model that brings these significantly advanced computing capacities to the redistricting process. Our model allows us to understand redistricting in fundamentally new ways and allows us to ...

[1]  Shaowen Wang,et al.  PEAR: a massively parallel evolutionary computation approach for political redistricting optimization and analysis , 2016, Swarm Evol. Comput..

[2]  Nicholas Stephanopoulos,et al.  Partisan Gerrymandering and the Efficiency Gap , 2014 .

[3]  W. Vickrey.  On the Prevention of Gerrymandering , 1961 .

[4]  M Keane,et al.  The Size of the Region-Building Problem , 1975 .

[5]  L Papayanopoulos,et al.  Democratic representation and apportionment: quantitative methods, measures, and criteria. Preface. , 1973, Annals of the New York Academy of Sciences.

[6]  Y. Frolov.  MEASURING THE SHAPE OF GEOGRAPHICAL PHENOMENA: A HISTORY OF THE ISSUE , 1975 .

[7]  Rein Taagepera,et al.  Seats and votes: A generalization of the cube law of elections , 1973 .

[8]  R. Niemi,et al.  Bias and Responsiveness in State Legislative Districting , 1991 .

[9]  John W. Shepherd,et al.  Decentralizing High School Administration in Detroit: An Evaluation of Alternative Strategies of Political Control , 1972 .

[10]  C. C. Harris,et al.  A scientific method of districting. , 1964, Behavioral science.

[11]  G. Nemhauser,et al.  Optimal Political Districting by Implicit Enumeration Techniques , 1970 .

[12]  S. Nagel.  Simplified Bipartisan Computer Redistricting , 1965 .

[13]  Richard L. Church,et al.  UC Office of the President Recent Work Title An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems Permalink , 2013 .

[14]  J D Thoreson,et al.  Computers in behavioral science. Legislative districting by computer simulation. , 1967, Behavioral science.

[15]  J. Weaver,et al.  A Procedure for Nonpartisan Districting: Development of Computer Techniques , 1963 .

[16]  B. Grofman,et al.  Measuring Compactness and the Role of a Compactness Standard in a Test for Partisan and Racial Gerrymandering , 1990, The Journal of Politics.

[17]  B. Grofman,et al.  The Future of Partisan Symmetry as a Judicial Test for Partisan Gerrymandering after LULAC v. Perry , 2007 .

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Peter J. Taylor,et al.  Seats, Votes, and the Spatial Organization of Elections , 1980 .

[20]  Richard G. Niemi,et al.  A Theory of Political Districting , 1978, American Political Science Review.

[21]  The Relationship Between Votes and Seats , 2016 .

[22]  R. Osserman.  The isoperimetric inequality , 1978 .

[23]  ChenJowei,et al.  Cutting Through the Thicket: Redistricting Simulations and the Detection of Partisan Gerrymanders , 2015 .

[24]  Eric McGhee,et al.  Measuring Partisan Bias in Single-Member District Electoral Systems: Measuring Partisan Bias , 2014 .