HackerPapers

arXiv:2011.09504cs.DS

Redistricting Algorithms

Amariah Becker, Justin Solomon

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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)

arXiv comments
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms cs.CYComputers and Society

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Nov 2020 to Nov 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.