相关论文: Drawing Competitive Districts in Redistricting

Algorithmic and statistical approaches to congressional redistricting are becoming increasingly valuable tools in courts and redistricting commissions for quantifying gerrymandering in the United States. While there is existing literature…

This paper investigates why and when the edge-based districting problem becomes computationally intractable. The overall problem is represented as an exact mathematical programming formulation consisting of an objective function and several…

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…

Redistricting is the process by which electoral district boundaries are drawn, and a common normative assumption in this process is that districts should be drawn so as to capture coherent communities of interest (COIs). While states rely…

Political districts may be drawn to favor one group or political party over another, or gerrymandered. A number of measurements have been suggested as ways to detect and prevent such behavior. These measures give concrete axes along which…

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…

In recent years, in an effort to promote fairness in the election process, a wide variety of techniques and metrics have been proposed to determine whether a map is a partisan gerrymander. The most accessible measures, requiring easily…

We introduce a non-partisan probability distribution on congressional redistricting of North Carolina which emphasizes the equal partition of the population and the compactness of districts. When random districts are drawn and the results…

The American winner-take-all congressional district system empowers politicians to engineer electoral outcomes by manipulating district boundaries. Existing computational solutions mostly focus on drawing unbiased maps by ignoring political…

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…

Assuming that partisan fairness and responsiveness are important aspects of redistricting, it is important to measure them. Many measures of partisan bias are satisfactory for states that are balanced with roughly equal proportions of…

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…

We investigate the distribution of partisanship in a cross-section of ten diverse States to elucidate how votes translate into seats won and other metrics. Markov chain simulations taking into account partisanship distribution agree…

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…

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…

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.…

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…

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…

Deciding whether a political districting plan was distorted by a hidden agenda, or whether it dilutes the voting power of some group, requires a neutral baseline for comparison. Remarkably, all nine U.S. Supreme Court justices have now…

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…