Fair redistricting is hard (Q2272397)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7102948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fair redistricting is hard |
scientific article; zbMATH DE number 7102948 |
Statements
Fair redistricting is hard (English)
0 references
10 September 2019
0 references
This paper studies the computational complexity of the problem of partitioning states into voting districts. Criteria to be satisfied by a fair distribution are discussed. It is shown that even for simple definitions of ``fair'' and ``legal'', deciding whether there exists a fair redistricting among legal maps is NP-hard, so that high computational complexity is inherent to the redistricting problem.
0 references
NP-hardness
0 references
computational complexity
0 references
gerrymandering
0 references
0.8672605752944946
0 references
0.8663842678070068
0 references
0.8503275513648987
0 references
0.8139738440513611
0 references
0.8058308959007263
0 references
