中文
相关论文

相关论文: An impossibility theorem for gerrymandering

200 篇论文

We compare and contrast fourteen measures that have been proposed for the purpose of quantifying partisan gerrymandering. We consider measures that, rather than examining the shapes of districts, utilize only the partisan vote distribution…

物理与社会 · 物理学 2019-04-18 Gregory S. Warrington

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…

计算机与社会 · 计算机科学 2023-12-08 Noah Lee , Hyunwoo Park , Sangho Shim

The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…

计算机科学与博弈论 · 计算机科学 2018-02-27 Batya Kenig

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…

计算机与社会 · 计算机科学 2007-08-17 Pan Kai , Tan Yue , Jiang Sheng

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…

计算复杂性 · 计算机科学 2018-08-28 Richard Kueng , Dustin G. Mixon , Soledad Villar

Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…

计算机科学与博弈论 · 计算机科学 2024-09-30 Daniel Halpern , Safwan Hossain , Jamie Tucker-Foltz

Gerrymandering is the perversion of an election based on manipulation of voting district boundaries, and has been a historically important yet difficult task to analytically prove. We propose a Markov Chain Monte Carlo with Simulated…

应用统计 · 统计学 2022-09-02 Stuart Wayland

The declination is a quantitative method for identifying possible partisan gerrymanders by analyzing vote distributions. In this expository note we explain and motivate the definition of the declination. The minimal computer code required…

物理与社会 · 物理学 2018-03-14 Gregory S. Warrington

There has been a recent media blitz on a cohort of mathematicians valiantly working to fix America's democratic system by combatting gerrymandering with geometry. While statistics commonly features in the courtroom (forensics, DNA analysis,…

历史与综述 · 数学 2017-09-19 Noah Giansiracusa , Cameron Ricciardi

The efficiency gap formula was introduced in to measure political gerrymandering. It played a key role in the Gill v. Whitford case whose appeal is currently before the Supreme Court, but it was very recently shown by Bernstein and Duchin…

物理与社会 · 物理学 2017-11-15 Kristopher Tapp

Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with…

数据结构与算法 · 计算机科学 2020-11-20 Amariah Becker , Justin Solomon

Various measures can be used to estimate bias or unfairness in a predictor. Previous work has already established that some of these measures are incompatible with each other. Here we show that, when groups differ in prevalence of the…

应用统计 · 统计学 2017-09-13 Thomas Miconi

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

计算机科学与博弈论 · 计算机科学 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh

We introduce the Geography and Election Outcome (GEO) metric, a new method for identifying potential partisan gerrymanders. In contrast with currently popular methods, the GEO metric uses both geographic information about a districting plan…

物理与社会 · 物理学 2022-04-27 Marion Campisi , Thomas Ratliff , Stephanie Somersille , Ellen Veomett

Manipulation is a problem of fundamental importance in the context of voting in which the voters exercise their votes strategically instead of voting honestly to prevent selection of an alternative that is less preferred. The…

多智能体系统 · 计算机科学 2015-02-17 Palash Dey , Neeldhara Misra , Y. Narahari

The Supreme Court's federal preemption decisions are notoriously unpredictable. Traditional left-right voting alignments break down in the face of competing ideological pulls. The breakdown of predictable voting blocs leaves the business…

综合经济学 · 经济学 2023-06-08 Gregory M. Dickinson

We explore the Declination, a new metric intended to detect partisan gerrymandering. We consider instances in which each district has equal turnout, the maximum turnout to minimum turnout is bounded, and turnout is unrestricted. For each of…

物理与社会 · 物理学 2018-12-17 Marion Campisi , Andrea Padilla , Thomas C. Ratliff , Ellen Veomett

Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…

计算机科学与博弈论 · 计算机科学 2023-07-07 Friedemann Kemm

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…

应用统计 · 统计学 2020-06-19 Benjamin Fifield , Kosuke Imai , Jun Kawahara , Christopher T. Kenny

The recent wave of attention to partisan gerrymandering has come with a push to refine or replace the laws that govern political redistricting around the country. A common element in several states' reform efforts has been the inclusion of…

计算机与社会 · 计算机科学 2020-05-27 Daryl DeFord , Moon Duchin , Justin Solomon