Political scientists don’t normally look to the bible for solutions to intractable problems. But maybe difficult times call for a modern application of ancient wisdom.
A story in Genesis describes how Abraham divided the land of Canaan into northern and southern parts and gave Lot his choice on which to settle and tend to his herd. This form of “fair-cake-cutting” has evolved into a handy method for parents to manage disputes among children and a thriving field of theoretical mathematics involving complicated procedures to ensure proportionality.
But no one has fully applied such a method to the real-world conundrum of how to create fair legislative districts. Until now.
Kevin DeLuca, faculty fellow with the Institution for Social and Policy Studies and assistant professor of political science, collaborated with Maxwell Palmer of Boston University and Benjamin Schneer of Harvard Kennedy School to devise a new method for drawing districts that, in their words, “reduces partisan gerrymandering without requiring a neutral third party (such as an independent commission, judge, or tiebreaker) or bipartisan agreement.”
“We took some inspiration from the cutting-the-cake problem and theoretical mathematical models that abstract away from geographic constraints, make assumptions about the distribution of voters, or require multiple rounds of complicated bargaining,” DeLuca said. “But we wanted to think concretely about how to devise a way in which states could apply this technique in a practical way using data from the real world.”
In a paper published in the journal Political Analysis in December, the researchers reveal the Define-Combine Procedure (DCP), in which one political party chooses contiguous, equal-population districts and the opposing party combines pairs of these selected districts to create the final districts. For example, if a state required 10 districts, the state’s Democratic representatives might define 20 districts, and then the Republicans would choose which neighboring pairs to combine and form a 10-district map.
Palmer created a website that includes the ability for users to run simulations and observe how DCP works.
The map above shows results of simulations in which congressional districts colored blue are always won by Democrats and those colored red are always won by Republicans, regardless of which party controls the process — either through DCP or a method in which the majority party controls the process unilaterally. Districts shaded in light or dark gray could be won by either party if given unilateral control. Dark gray districts could be won by either party if utilizing DCP. And those outlined in blue would be won by Democrats using DCP, with those outlined in red won by Republicans using DCP.
“This process allows each party to act in their own partisan self-interest but achieves a significantly fairer map than would be drawn by either party on its own,” the researchers write in a summary of their paper. “By dividing the responsibility into two separate steps, in which each party retains complete control, the parties counteract each other’s partisan ambitions while maintaining considerable flexibility to achieve other objectives, including maintaining compactness and communities of interest.”