arXiv:1710.08781cs.GT
A partisan districting protocol with provably nonpartisan outcomes
Abstract
We design and analyze a protocol for dividing a state into districts, where parties take turns proposing a division, and freezing a district from the other party's proposed division. We show that our protocol has predictable and provable guarantees for both the number of districts in which each party has a majority of supporters, and the extent to which either party has the power to pack a specific population into a single district.
Some mathematicians worked out a way to fairly do districting, similar to having one kid cut the cake and the other kid gets first choice: "A partisan districting protocol with provably nonpartisan outcomes" by Wesley Pegden, Ariel D. Procaccia, Dingli Yu…
WalterBrightView on HNParent context