Redistricting Algorithms

11/18/2020
by   Amariah Becker, et al.
0

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)

READ FULL TEXT

page 5

page 6

page 9

page 11

page 12

page 14

page 15

page 31

research
10/28/2020

Three Applications of Entropy to Gerrymandering

This preprint is an exploration in how a single mathematical idea - entr...
research
10/27/2020

Political Geography and Representation: A Case Study of Districting in Pennsylvania

This preprint offers a detailed look, both qualitative and quantitative,...
research
01/10/2015

Autonomous Farm Vehicles: Prototype of Power Reaper

Chapter 2 will begin with introduction of Agricultural Robotics. There w...
research
09/07/2020

Transparency and granularity in the SP Theory of Intelligence and its realisation in the SP Computer Model

This chapter describes how the SP System, meaning the SP Theory of Intel...
research
03/02/2022

Centralized Fairness for Redistricting

In representative democracy, the electorate is often partitioned into di...
research
05/24/2023

Deep Learning and Ethics

This article appears as chapter 21 of Prince (2023, Understanding Deep L...
research
09/11/2022

Synthetic Wavelength Imaging – Utilizing Spectral Correlations for High-Precision Time-of-Flight Sensing

This book chapter describes how spectral correlations in scattered light...

Please sign up or login with your details

Forgot password? Click here to reset