Three Applications of Entropy to Gerrymandering
- URL: http://arxiv.org/abs/2010.14972v2
- Date: Wed, 4 Nov 2020 17:30:43 GMT
- Title: Three Applications of Entropy to Gerrymandering
- Authors: Larry Guth, Ari Nieh, Thomas Weighill
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. This
preprint was prepared as a chapter in the forthcoming edited volume Political
Geometry, an interdisciplinary collection of essays on redistricting.
(mggg.org/gerrybook)
Related papers
- Fast Rates for Maximum Entropy Exploration [52.946307632704645]
We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards.
We study the maximum entropy exploration problem two different types.
For visitation entropy, we propose a game-theoretic algorithm that has $widetildemathcalO(H3S2A/varepsilon2)$ sample complexity.
For the trajectory entropy, we propose a simple algorithm that has a sample of complexity of order $widetildemathcalO(mathrmpoly(S,
arXiv Detail & Related papers (2023-03-14T16:51:14Z) - Uncovering Challenges of Solving the Continuous Gromov-Wasserstein Problem [63.99794069984492]
The Gromov-Wasserstein Optimal Transport (GWOT) problem has attracted the special attention of the ML community.
We crash-test existing continuous GWOT approaches on different scenarios, carefully record and analyze the obtained results, and identify issues.
We propose a new continuous GWOT method which does not rely on discrete techniques and partially solves some of the problems of competitors.
arXiv Detail & Related papers (2023-03-10T15:21:12Z) - Sampling-based techniques for designing school boundaries [26.73720392872553]
We propose a set of sampling techniques for designing school boundaries based on the flip proposal.
These techniques can be used as a baseline for comparing redistricting algorithms based on local search.
We empirically touch on both these aspects in regards to the problem of school redistricting.
arXiv Detail & Related papers (2022-06-08T06:45:55Z) - 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) - Measuring Geometric Similarity Across Possible Plans for Automated
Redistricting [0.0]
This paper briefly introduces an interpretive measure of similarity, and a corresponding assignment matrix, that corresponds to the percentage of a state's area or population that stays in the same congressional district between two plans.
We then show how to calculate this measure in an intuitive time and briefly demonstrate some potential use-cases.
arXiv Detail & Related papers (2021-11-17T03:37:25Z) - On Applying the Lackadaisical Quantum Walk Algorithm to Search for
Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$.
This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z) - 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) - 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) - Predictive Bandits [68.8204255655161]
We introduce and study a new class of bandit problems, referred to as predictive bandits.
In each round, the decision maker first decides whether to gather information about the rewards of particular arms.
The decision maker then selects an arm to be actually played in the round.
arXiv Detail & Related papers (2020-04-02T17:12:33Z) - The Price of Incentivizing Exploration: A Characterization via Thompson
Sampling and Sample Complexity [83.81297078039836]
We consider incentivized exploration: a version of multi-armed bandits where the choice of arms is controlled by self-interested agents.
We focus on the price of incentives: the loss in performance, broadly construed, incurred for the sake of incentive-compatibility.
arXiv Detail & Related papers (2020-02-03T04:58:51Z)
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.