A partisan districting protocol with provably nonpartisan outcomes
Computer Science and Game Theory
2017-10-25 v1 Combinatorics
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.
Cite
@article{arxiv.1710.08781,
title = {A partisan districting protocol with provably nonpartisan outcomes},
author = {Wesley Pegden and Ariel D. Procaccia and Dingli Yu},
journal= {arXiv preprint arXiv:1710.08781},
year = {2017}
}
Comments
20 pages, 3 figures