A partisan districting protocol with provably nonpartisan outcomes
classification
💻 cs.GT
math.CO
keywords
partyprotocoldistrictdistrictsdivisionanalyzedesigndistricting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.