A partisan districting protocol with provably nonpartisan outcomes

10/24/2017
by   Wesley Pegden, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2018

Negotiation Strategies for Agents with Ordinal Preferences

Negotiation is a very common interaction between automated agents. Many ...
research
09/06/2022

Classification Protocols with Minimal Disclosure

We consider multi-party protocols for classification that are motivated ...
research
02/22/2018

A Cut-And-Choose Mechanism to Prevent Gerrymandering

We present a novel mechanism to endogenously choose a fair division of a...
research
05/20/2023

You Can Have Your Cake and Redistrict It Too

The design of algorithms for political redistricting generally takes one...
research
02/08/2022

Predicting Voting Outcomes in the Presence of Communities, Echo Chambers and Multiple Parties

A recently proposed graph-theoretic metric, the influence gap, has shown...
research
11/22/2019

Minority Voter Distributions and Partisan Gerrymandering

Many people believe that it is disadvantageous for members aligning with...
research
10/23/2018

SATE: Robust and Private Allegation Escrows

For fear of retribution, the victim of a crime may be willing to report ...

Please sign up or login with your details

Forgot password? Click here to reset