English
Related papers

Related papers: Fair redistricting is hard

200 papers

We study the computational complexity of the map redistricting problem (gerrymandering). Mathematically, the electoral district designer (gerrymanderer) attempts to partition a weighted graph into $k$ connected components (districts) such…

Computer Science and Game Theory · Computer Science 2024-01-09 Jack Dippel , Max Dupré la Tour , April Niu , Sanjukta Roy , Adrian Vetta

Roughly speaking, gerrymandering is the systematic manipulation of the boundaries of electoral districts to make a specific (political) party win as many districts as possible. While typically studied from a geographical point of view,…

Data Structures and Algorithms · Computer Science 2021-02-18 Matthias Bentert , Tomohiro Koana , Rolf Niedermeier

Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AAMAS 2017] initiated the algorithmic study of a…

Data Structures and Algorithms · Computer Science 2020-02-19 Eduard Eiben , Fedor V. Fomin , Fahad Panolan , Kirill Simonov

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

The topic of this paper is "gerrymandering", namely the curse of deliberate creations of district maps with highly asymmetric electoral outcomes to disenfranchise voters, and it has a long legal history. Measuring and eliminating…

Computational Complexity · Computer Science 2020-08-05 Tanima Chatterjee , Bhaskar DasGupta

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

The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that they unfairly favor a particular political party, often…

Data Structures and Algorithms · Computer Science 2024-02-22 Jin-Yi Cai , Jacob Kruse , Kenneth Mayer , Daniel P. Szabo

As granular data about elections and voters become available, redistricting simulation methods are playing an increasingly important role when legislatures adopt redistricting plans and courts determine their legality. These simulation…

Applications · Statistics 2020-06-19 Benjamin Fifield , Kosuke Imai , Jun Kawahara , Christopher T. Kenny

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

In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to…

Data Structures and Algorithms · Computer Science 2023-12-08 Andrew Fraser , Brian Lavallee , Blair D. Sullivan

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

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

In representative democracy, a redistricting map is chosen to partition an electorate into districts which each elects a representative. A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous,…

Computer Science and Game Theory · Computer Science 2024-12-10 Seyed A. Esmaeili , Darshan Chakrabarti , Hayley Grape , Brian Brubach

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

Redistricting is the problem of dividing a state into a number $k$ of regions, called districts. Voters in each district elect a representative. The primary criteria are: each district is connected, district populations are equal (or nearly…

Data Structures and Algorithms · Computer Science 2020-09-02 Vincent Cohen-Addad , Philip N. Klein , Dániel Marx

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

Gerrymandering is the practice of drawing biased electoral maps that manipulate the voter population to gain an advantage. The most recent time gerrymandering became an issue was 2019 when the U.S. Federal Supreme Court decided that the…

Computers and Society · Computer Science 2023-12-08 Noah Lee , Hyunwoo Park , Sangho Shim

Bizarrely shaped voting districts are frequently lambasted as likely instances of gerrymandering. In order to systematically identify such instances, researchers have devised several tests for so-called geographic compactness (i.e., shape…

Combinatorics · Mathematics 2019-07-10 Boris Alexeev , Dustin G. Mixon

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 NP-hard Fair Connected Districting problem recently proposed by Stoica et al. [AAMAS 2020]: Partition a vertex-colored graph into k connected components (subsequently referred to as districts) so that in every district the most…

Computer Science and Game Theory · Computer Science 2022-04-11 Niclas Boehmer , Tomohiro Koana , Rolf Niedermeier
‹ Prev 1 2 3 10 Next ›