Abstract
Abstract
Redistricting reformers have proposed many solutions to the problem of partisan gerrymandering, but they all require either bipartisan consensus or the agreement of both parties on the legitimacy of a neutral third party to resolve disputes. In this paper, we propose a new method for drawing district maps, the Define–Combine Procedure, that substantially reduces partisan gerrymandering without requiring a neutral third party or bipartisan agreement. One party defines a map of
$2N$
equal-population contiguous districts. Then the second party combines pairs of contiguous districts to create the final map of N districts. Using real-world geographic and electoral data, we employ simulations and map-drawing algorithms to show that this procedure dramatically reduces the advantage conferred to the party controlling the redistricting process and leads to less-biased maps without requiring cooperation or non-partisan actors.
Publisher
Cambridge University Press (CUP)
Subject
Political Science and International Relations,Sociology and Political Science
Reference26 articles.
1. Making Partisan Gerrymandering Fair: One Old and Two New Methods;Brams;Social Science Quarterly,2020
2. Kenny, C. , and McCartan, C. . 2021. “Alarm Project: 2020 Redistricting Data Files.” https://github.com/alarm-redist/census-2020/.
3. Palmer, M. , Schneer, B. , and DeLuca, K. (2023). “Replication Data for: A Partisan Solution to Partisan Gerrymandering: The Define–Combine Procedure.” Harvard Dataverse, V1. https://doi.org/10.7910/DVN/XBYFE1
4. Brennan Center for Justice. 2018. “Redistricting Commissions: What Works.” Technical report, Brennan Center for Justice.
5. Redistricting Commissions in the Western United States;Miller;UC Irvine Law Review,2013