Redistricting Algorithms
- URL: http://arxiv.org/abs/2011.09504v1
- Date: Wed, 18 Nov 2020 19:19:20 GMT
- Title: Redistricting Algorithms
- Authors: Amariah Becker and Justin Solomon
- Abstract summary: 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.
- Score: 33.034434458254275
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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 this idea. In this chapter, two computer scientists survey what's
been done in algorithmic redistricting, 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, an interdisciplinary collection
of essays on redistricting. (https://mggg.org/gerrybook)
Related papers
- Efficient Lower Bounding of Single Transferable Vote Election Margins [56.12949230611067]
Single transferable vote (STV) is a system of preferential proportional voting employed in multi-seat elections.
The margin of victory, or simply margin, is the smallest number of ballots that, if manipulated, can alter the set of winners.
Lower bounds on the margin can also be used for this purpose, in cases where exact margins are difficult to compute.
arXiv Detail & Related papers (2025-01-24T13:39:23Z) - Optimal bounds for dissatisfaction in perpetual voting [84.02572742131521]
We consider a perpetual approval voting method that guarantees that no voter is dissatisfied too many times.
We identify a sufficient condition on voter behavior under which a sublinear growth of dissatisfaction is possible.
We present a voting method with sublinear guarantees on dissatisfaction under bounded conflicts, based on the standard techniques from prediction with expert advice.
arXiv Detail & Related papers (2024-12-20T19:58:55Z) - Mathematically Quantifying Non-responsiveness of the 2021 Georgia
Congressional Districting Plan [3.097163558730473]
We use a Metropolized-sampling technique through a parallel tempering method combined with ReCom.
We develop these improvements through the first case study of district plans in Georgia.
Our analysis projects that any election in Georgia will reliably elect 9 Republicans and 5 Democrats under the enacted plan.
arXiv Detail & Related papers (2022-03-13T02:58:32Z) - Implications of Distance over Redistricting Maps: Central and Outlier Maps [10.318010762465939]
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, and of almost-equal population.
This enables a partisan legislature to gerrymander by choosing a map which unfairly favors it.
arXiv Detail & Related papers (2022-03-02T04:59:30Z) - Mathematical Analysis of Redistricting in Utah [0.0]
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.
arXiv Detail & Related papers (2021-07-12T15:38:34Z) - 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) - Selection-Expansion: A Unifying Framework for Motion-Planning and
Diversity Search Algorithms [69.87173070473717]
We investigate the properties of two diversity search algorithms, the Novelty Search and the Goal Exploration Process algorithms.
The relation to MP algorithms reveals that the smoothness, or lack of smoothness of the mapping between the policy parameter space and the outcome space plays a key role in the search efficiency.
arXiv Detail & Related papers (2021-04-10T13:52:27Z) - Three Applications of Entropy to Gerrymandering [0.0]
This preprint is an exploration in how a single mathematical idea - entropy - can be applied to redistricting in a number of ways.
It's meant to be read not so much as a call to action for entropy, but as a case study illustrating one of the many ways math can inform our thinking on redistricting problems.
arXiv Detail & Related papers (2020-10-28T13:34:07Z) - Political Geography and Representation: A Case Study of Districting in
Pennsylvania [0.0]
We investigate how much the partisan playing field is tilted by political geography.
We find that partisan-neutral maps rarely give seats proportional to votes, and that making the district size smaller tends to make it even harder to find a proportional map.
arXiv Detail & Related papers (2020-10-27T21:01:10Z) - Fine-Grained Crowd Counting [59.63412475367119]
Current crowd counting algorithms are only concerned with the number of people in an image.
We propose fine-grained crowd counting, which differentiates a crowd into categories based on the low-level behavior attributes of the individuals.
arXiv Detail & Related papers (2020-07-13T01:31:12Z)
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.