English
Related papers

Related papers: The Fairness of Redistricting Ghost

200 papers

Inspired by the word game Ghost, we propose a new protocol for bipartisan redistricting in which partisan players take turns assigning precincts to districts. We prove that in an idealized setting, if both parties have the same number…

Combinatorics · Mathematics 2018-12-19 Dustin G. Mixon , Soledad Villar

Landau, Reid, and Yershov [A Fair Division Solution to the Problem of Redistricting, \textit{Social Choice and Welfare}, 2008] propose a protocol for drawing legislative districts based on a two player fair division process, where each…

Combinatorics · Mathematics 2018-11-15 Jessica De Silva , Brady Gales , Bryson Kagy , David Offner

This paper presents a novel mechanism to endogenously determine the fair division of a state into electoral districts in a two-party setting. No geometric constraints are imposed on voter distributions or district shapes; instead, it is…

Computer Science and Game Theory · Computer Science 2019-01-07 Jamie Tucker-Foltz

Recently, Landau, Reid and Yershov provided a novel solution to the problem of redistricting. Instead of trying to ensure fairness by restricting the shape of the possible maps or by assigning the power to draw the map to nonbiased…

Computer Science and Game Theory · Computer Science 2023-09-04 Zeph Landau , Francis Edward Su

American democracy is currently heavily reliant on plurality in single-member districts, or PSMD, as a system of election. But public perceptions of fairness are often keyed to partisan proportionality, or the degree of congruence between…

Computers and Society · Computer Science 2023-08-23 Moon Duchin , Gabe Schoenbach

The design of algorithms for political redistricting generally takes one of two approaches: optimize an objective such as compactness or, drawing on fair division, construct a protocol whose outcomes guarantee partisan fairness. We aim to…

Computer Science and Game Theory · Computer Science 2023-05-23 Gerdus Benadè , Ariel D. Procaccia , Jamie Tucker-Foltz

Gerrymandering, the deliberate manipulation of electoral district boundaries for political advantage, is a persistent issue in U.S. redistricting cycles. This paper introduces and analyzes a new phenomenon, 'votemandering'- a strategic…

Computer Science and Game Theory · Computer Science 2023-08-17 Sanyukta Deshpande , Ian G Ludden , Sheldon H Jacobson

Political actors often manipulate redistricting plans to gain electoral advantages, a process known as gerrymandering. Several states have implemented institutional reforms to address this problem, such as establishing map-drawing…

Applications · Statistics 2025-08-12 Cory McCartan , Christopher T. Kenny , Tyler Simko , Emma Ebowe , Michael Y. Zhao , Kosuke Imai

In this paper, we propose to use the concept of local fairness for auditing and ranking redistricting plans. Given a redistricting plan, a deviating group is a population-balanced contiguous region in which a majority of individuals are of…

Computer Science and Game Theory · Computer Science 2022-11-22 Shao-Heng Ko , Erin Taylor , Pankaj K. Agarwal , Kamesh Munagala

In many practical scenarios, a population is divided into disjoint groups for better administration, e.g., electorates into political districts, employees into departments, students into school districts, and so on. However, grouping people…

Social and Information Networks · Computer Science 2019-09-13 Ana-Andreea Stoica , Abhijnan Chakraborty , Palash Dey , Krishna P. Gummadi

Gerrymandering is a long-standing issue within the U.S. political system, and it has received scrutiny recently by the U.S. Supreme Court. In this note, we prove that deciding whether there exists a fair redistricting among legal maps is…

Computational Complexity · Computer Science 2018-08-28 Richard Kueng , Dustin G. Mixon , Soledad Villar

We model the societal task of redistricting political districts as a partitioning problem: Given a set of $n$ points in the plane, each belonging to one of two parties, and a parameter $k$, our goal is to compute a partition $\Pi$ of the…

Data Structures and Algorithms · Computer Science 2021-12-16 Pankaj K. Agarwal , Shao-Heng Ko , Kamesh Munagala , Erin Taylor

Redistricting efforts have gathered contemporary attention in both popular and scholarly debates, particularly in the United States where efforts to redraw congressional districts to favor either of the two major parties in 12 states --…

Computer Science and Game Theory · Computer Science 2026-05-22 Michael C. Chavrimootoo , Aidan Jeansonne

In the process of redistricting, one important metric is the number of competitive districts, that is, districts where both parties have a reasonable chance of winning a majority of votes. Competitive districts are important for achieving…

Data Structures and Algorithms · Computer Science 2024-04-18 Gabriel Chuang , Oussama Hanguir , Clifford Stein

Switching from one electoral system to another one is frequently criticized by the opposition and is viewed as a means for the ruling party to stay in power. In particular, when the new electoral system is a parallel voting (or a…

Physics and Society · Physics 2020-02-18 Igor Mandric , Igor Roşca , Radu Buzatu

This preprint offers a detailed look, both qualitative and quantitative, at districting with respect to recent voting patterns in one state: Pennsylvania. We investigate how much the partisan playing field is tilted by political geography.…

Computers and Society · Computer Science 2020-11-05 Jonathan Rodden , Thomas Weighill

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…

Computer Science and Game Theory · Computer Science 2017-10-25 Wesley Pegden , Ariel D. Procaccia , Dingli Yu

The gerrymandering problem is a worldwide problem which sets great threat to democracy and justice in district based elections. Thanks to partisan redistricting commissions, district boundaries are often manipulated to benefit incumbents.…

Computers and Society · Computer Science 2015-10-14 Lucy Chenyun Wu , Jason Xiaotian Dou , Danny Sleator , Alan Frieze , David Miller

We study the problem of a partisan gerrymanderer who assigns voters to equipopulous districts so as to maximize his party's expected seat share. The designer faces both aggregate uncertainty (how many votes his party will receive) and…

Theoretical Economics · Economics 2023-04-20 Anton Kolotilin , Alexander Wolitzky

Fairness in multiwinner elections is studied in varying contexts. For instance, diversity of candidates and representation of voters are both separately termed as being fair. A common denominator to ensure fairness across all such contexts…

Computer Science and Game Theory · Computer Science 2022-11-24 Kunal Relia
‹ Prev 1 2 3 10 Next ›