Redistricting algorithms

Amariah Becker and Justin Solomon
Additional contact information
Amariah Becker: Metric Geometry and Gerrymandering Group (MGGG)
Justin Solomon: Massachusetts Institute of Technology

A chapter in Political Geometry, 2022, pp 303-340 from Springer

Abstract: Abstract Why not have a computer just draw the best map? For many people, this is the first and only reasonable approach to the problem of gerrymandering. But there are more than a few reasons to be skeptical of this idea. In this chapter, two computer scientists survey what’s been done in algorithmic redistricting, with an eye to what computers can and can’t do.

Date: 2022
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-69161-9_16

Ordering information: This item can be ordered from
http://www.springer.com/9783319691619

DOI: 10.1007/978-3-319-69161-9_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().