English
Related papers

Related papers: Fairmandering: A column generation heuristic for f…

200 papers

Partisan gerrymandering poses a threat to democracy. Moreover, the complexity of the districting task may exceed human capacities. One potential solution is using computational models to automate the districting process by optimizing…

Computers and Society · Computer Science 2020-06-30 Olivia Guest , Frank J. Kanayet , Bradley C. Love

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

Every representative democracy must specify a mechanism under which voters choose their representatives. The most common mechanism in the United States -- Winner takes all single-member districts -- both enables substantial partisan…

Computer Science and Game Theory · Computer Science 2026-02-23 Nikhil Garg , Wes Gurnee , David Rothschild , David Shmoys

In redistricting litigation, effective enforcement of the Voting Rights Act has often involved providing the court with districting plans that display a larger number of majority-minority districts than the current proposal (as was true,…

Data Structures and Algorithms · Computer Science 2025-09-08 Daniel Brous , David Shmoys

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

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

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

The problem of column subset selection asks for a subset of columns from an input matrix such that the matrix can be reconstructed as accurately as possible within the span of the selected columns. A natural extension is to consider a…

Machine Learning · Computer Science 2024-08-13 Antonis Matakos , Bruno Ordozgoiti , Suhas Thejaswi

Geographical considerations such as contiguity and compactness are necessary elements of political districting in practice. Yet an analysis of the problem without such constraints yields mathematical insights that can inform real-world…

Physics and Society · Physics 2022-02-04 Gerdus Benade , Nam Ho-Nguyen , J. N. Hooker

The outcome of elections is strongly dependent on the districting choices, making thus possible (and frequent) the gerrymandering phenomenon, i.e.\ politicians suitably changing the shape of electoral districts in order to win the…

Optimization and Control · Mathematics 2019-10-22 Alberto Saracco , Giorgio Saracco

This paper is to obtain a simple dividing-diagram of the congressional districts, where the only limit is that each district should contain the same population if possibly. In order to solve this problem, we introduce three different…

Computers and Society · Computer Science 2007-08-17 Pan Kai , Tan Yue , Jiang Sheng

After every U.S. national census, a state legislature is required to redraw the boundaries of congressional districts in order to account for changes in population. At the moment this is done in a highly partisan way, with districting done…

Computers and Society · Computer Science 2017-11-15 Jason Dou

We propose a randomized method for solving linear programs with a large number of columns but a relatively small number of constraints. Since enumerating all the columns is usually unrealistic, such linear programs are commonly solved by…

Optimization and Control · Mathematics 2023-11-29 Yi-Chun Akchen , Velibor V. Mišić

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

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

Decision trees are highly interpretable models for solving classification problems in machine learning (ML). The standard ML algorithms for training decision trees are fast but generate suboptimal trees in terms of accuracy. Other discrete…

Machine Learning · Computer Science 2024-01-24 Krunal Kishor Patel , Guy Desaulniers , Andrea Lodi

In this paper, we apply techniques of ensemble analysis to understand the political baseline for Congressional representation in Colorado. We generate a large random sample of reasonable redistricting plans and determine the partisan…

Computers and Society · Computer Science 2021-03-25 Jeanne Clelland , Haley Colgate , Daryl DeFord , Beth Malmskog , Flavia Sancier-Barbosa

Recently, an increasing number of researchers, especially in the realm of political redistricting, have proposed sampling-based techniques to generate a subset of plans from the vast space of districting plans. These techniques have been…

Artificial Intelligence · Computer Science 2022-06-09 Subhodip Biswas , Fanglan Chen , Zhiqian Chen , Chang-Tien Lu , Naren Ramakrishnan

This paper presents a new column-and-constraint generation method for two-stage robust mixed-integer programs with finite uncertainty sets. Our method combines and extends speed-up techniques used in previous column-and-constraint…

Optimization and Control · Mathematics 2025-11-04 Marc Goerigk , Dorothee Henke , Johannes Kager , Fabian Schäfer , Clemens Thielen

Partisan gerrymandering is a major cause for voter disenfranchisement in United States. However, convincing US courts to adopt specific measures to quantify gerrymandering has been of limited success to date. Recently, Stephanopoulos and…

Computers and Society · Computer Science 2018-04-30 Tanima Chatterjee , Bhaskar DasGupta , Laura Palmieri , Zainab Al-Qurashi , Anastasios Sidiropoulos
‹ Prev 1 2 3 10 Next ›