Mathematical Analysis of Redistricting in Utah

• URL: http://arxiv.org/abs/2107.05515v3
• Date: Tue, 19 Jul 2022 23:26:49 GMT
• Title: Mathematical Analysis of Redistricting in Utah
• Authors: Annika King, Jacob Murri, Jake Callahan, Adrienne Russell, Tyler J. Jarvis
• Abstract summary: We discuss difficulties of evaluating partisan gerrymandering in the congressional districts in Utah. We explain why the Republican vote share in the least-Republican district (LRVS) is a good indicator of the advantage or disadvantage each party has in the Utah congressional districts. We also discuss the implications of this new metric and our results on the question of whether the 2011 Utah congressional plan was gerrymandered.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We discuss difficulties of evaluating partisan gerrymandering in the congressional districts in Utah and the failure of many common metrics in Utah. We explain why the Republican vote share in the least-Republican district (LRVS) is a good indicator of the advantage or disadvantage each party has in the Utah congressional districts. Although the LRVS only makes sense in settings with at most one competitive district, in that setting it directly captures the extent to which a given redistricting plan gives advantage or disadvantage to the Republican and Democratic parties. We use the LRVS to evaluate the most common measures of partisan gerrymandering in the context of Utah's 2011 congressional districts. We do this by generating large ensembles of alternative redistricting plans using Markov chain Monte Carlo methods. We also discuss the implications of this new metric and our results on the question of whether the 2011 Utah congressional plan was gerrymandered.

Related papers

• Representation Bias in Political Sample Simulations with Large Language Models [54.48283690603358]
  This study seeks to identify and quantify biases in simulating political samples with Large Language Models. Using the GPT-3.5-Turbo model, we leverage data from the American National Election Studies, German Longitudinal Election Study, Zuobiao dataset, and China Family Panel Studies.
  arXiv  Detail & Related papers  (2024-07-16T05:52:26Z)
• Drawing Competitive Districts in Redistricting [1.5654305985353367]
  We discuss the problem of drawing plans with at least a fixed number of competitive districts. We show that the task of drawing plans with competitive districts is NP-hard, even on very natural instances. We show that a simple hill-climbing procedure can in practice find districtings on real states in which all the districts are competitive.
  arXiv  Detail & Related papers  (2024-04-17T00:09:41Z)
• Estimating Geographic Spillover Effects of COVID-19 Policies From Large-Scale Mobility Networks [54.90772000796717]
  County-level policies provide flexibility between regions, but may become less effective in the presence of geographic spillovers. We estimate spillovers using a mobility network with billions of timestamped edges. We find that county-level restrictions are only 54% as effective as statewide restrictions at reducing mobility.
  arXiv  Detail & Related papers  (2022-12-12T20:16:54Z)
• Untangling the Dueling Expert Witnesses: Comparing Ensemble Methods in Pennsylvania's Redistricting Plans [0.0]
  Ensembles of random legislative districts are a valuable tool for assessing whether a proposed district plan is an outlier or gerrymander. Recent open source methods now permit independent validation of expert witness testimony. We compare ensembles for the Pennsylvania House and Congressional districts calculated using "Redist" and "Gerrychain"
  arXiv  Detail & Related papers  (2022-08-18T00:03:40Z)
• Implications of Distance over Redistricting Maps: Central and Outlier Maps [6.757783454836096]
  In representative democracy, a redistricting map is chosen to partition an electorate into a collection of districts each of which elects a representative. A valid redistricting map must satisfy a collection of constraints such as being compact, contiguous, and of almost equal population. This fact introduces a difficulty in drawing redistricting maps and it also enables a partisan legislature to possibly gerrymander by choosing a map which unfairly favors it.
  arXiv  Detail & Related papers  (2022-03-02T04:59:30Z)
• Obvious Manipulability of Voting Rules [105.35249497503527]
  The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability.
  arXiv  Detail & Related papers  (2021-11-03T02:41:48Z)
• Bribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules [58.8640284079665]
  We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RAV, approval-based Chamberlin--Courant, and PAV) In general, our problems tend to be easier when we limit out bribery actions on increasing the number of approvals of the candidate that we want to be in a winning committee.
  arXiv  Detail & Related papers  (2021-04-19T08:26:40Z)
• Redistricting Algorithms [33.034434458254275]
  In this chapter, two computer scientists survey what's been done in algorithmic redistricting. They discuss what doesn't work and highlight approaches that show promise. This preprint was prepared as a chapter in the forthcoming edited volume Political Geometry.
  arXiv  Detail & Related papers  (2020-11-18T19:19:20Z)
• Colorado in Context: Congressional Redistricting and Competing Fairness Criteria in Colorado [0.0]
  We generate a large random sample of reasonable redistricting plans and determine the partisan balance of each district using returns from state-wide elections in 2018. We investigate the relationships between partisan outcomes, number of counties which are split, and number of competitive districts in a plan.
  arXiv  Detail & Related papers  (2020-11-11T20:05:50Z)
• Adaptive Combinatorial Allocation [77.86290991564829]
  We consider settings where an allocation has to be chosen repeatedly, returns are unknown but can be learned, and decisions are subject to constraints. Our model covers two-sided and one-sided matching, even with complex constraints.
  arXiv  Detail & Related papers  (2020-11-04T15:02:59Z)
• A Computational Approach to Measuring Vote Elasticity and Competitiveness [24.88022242349515]
  competitiveness metrics evaluate a districting plan based on the extent to which district-level outcomes are in play or are likely to be closely contested. This paper examines several classes of competitiveness metrics motivated by recent reform proposals and then evaluate their potential outcomes across large ensembles of districting plans at the Congressional and state Senate levels. We highlight situation-specific difficulties in creating good competitiveness metrics and show that optimizing competitiveness can produce unintended consequences on other partisan metrics.
  arXiv  Detail & Related papers  (2020-05-26T14:01:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.