Skip to content
Back to the collection

A partisan districting protocol with provably nonpartisan outcomes

Wesley Pegden, Ariel D. Procaccia, Dingli Yu

2017 · arXiv

Read the paper
HN score
0
Mentions
5
Readers
3
Months
5
What’s in a score?

From the 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.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

5 selected excerpts · 5 total mentions

MengerSponge
Neutral mention · rule
Any attempt to completely automate this process is destined to fail, for all the reasons given in this thread. Weighting factors matter, and it is naive to assume that nobody is going to attempt to subvert a nonpartisan board, when so much power is at stake. Don't despair! There's an alternative that generates an equitable outcome between two parties that are trying to screw their rivals: Cake Cutting. https://arxiv.org/abs/1710.08781v1 You've probably heard the basic version of how to fairly divide a piece of cake between two children. Have one of them cut it, then the other choose which piece to keep. The cutter guarantees the largest possible piece of cake by cutting the cake in half. This is the same idea, just extended: one party divides the state into districts, then the other chooses one district to "lock" and divides the remainder, then the process repeats.

Keep following the thread.

More in Other research

More from the same topics.