You Can Have Your Cake and Redistrict It Too

by   Gerdus Benadè, et al.

The design of algorithms for political redistricting generally takes one of two approaches: optimize an objective such as compactness or, drawing on fair division, construct a protocol whose outcomes guarantee partisan fairness. We aim to have the best of both worlds by optimizing an objective subject to a binary fairness constraint. As the fairness constraint we adopt the geometric target, which requires the number of seats won by each party to be at least the average (rounded down) of its outcomes under the worst and best partitions of the state. To study the feasibility of this approach, we introduce a new model of redistricting that closely mirrors the classic model of cake-cutting. This model has two innovative features. First, in any part of the state there is an underlying 'density' of voters with political leanings toward any given party, making it impossible to finely separate voters for different parties into different districts. This captures a realistic constraint that previously existing theoretical models of redistricting tend to ignore. Second, parties may disagree on the distribution of voters - whether by genuine disagreement or attempted strategic behavior. In the absence of a 'ground truth' distribution, a redistricting algorithm must therefore aim to simultaneously be fair to each party with respect to its own reported data. Our main theoretical result is that, surprisingly, the geometric target is always feasible with respect to arbitrarily diverging data sets on how voters are distributed. Any standard for fairness is only useful if it can be readily satisfied in practice. Our empirical results, which use real election data and maps of six US states, demonstrate that the geometric target is always feasible, and that imposing it as a fairness constraint comes at almost no cost to three well-studied optimization objectives.


page 16

page 25

page 26

page 27


A partisan districting protocol with provably nonpartisan outcomes

We design and analyze a protocol for dividing a state into districts, wh...

FedFair: Training Fair Models In Cross-Silo Federated Learning

Building fair machine learning models becomes more and more important. A...

Redistricting for Proportionality

American democracy is currently heavily reliant on plurality in single-m...

Exploring Fairness in District-based Multi-party Elections under different Voting Rules using Stochastic Simulations

Many democratic societies use district-based elections, where the region...

Fairmandering: A column generation heuristic for fairness-optimized political districting

The American winner-take-all congressional district system empowers poli...

Picking Sequences and Monotonicity in Weighted Fair Division

We study the problem of fairly allocating indivisible items to agents wi...

Votemandering: Strategies and Fairness in Political Redistricting

Gerrymandering, the deliberate manipulation of electoral district bounda...

Please sign up or login with your details

Forgot password? Click here to reset