Fair redistricting is hard
Fair redistricting is hard
复制标题
公平的选区重划很难
DOI:
10.1016/j.tcs.2019.04.004
复制
发表时间:
2019
影响因子:
1.1
通讯作者:
Villar, Soledad
中科院分区:
文献类型:
--
作者:
Kueng, Richard;Mixon, Dustin G.;Villar, Soledad
Gerrymandering is a long-standing issue within the US political system, and it has received scrutiny recently by the US Supreme Court. In this note, we prove that deciding whether there exists a fair redistricting among legal maps is NP-hard. To make this precise, we use simplified notions of “legal” and “fair” that account for desirable traits such as geographic compactness of districts and sufficient representation of voters. The proof of our result is inspired by the work of Mahanjan, Minbhorkar and Varadarajan that proves that planar k-means is NP-hard.
登录
查看更多内容
DOI:
10.1080/10618600.2020.1739532
发表时间:
2020-05-07
影响因子:
2.4
作者:
Fifield, Benjamin;Higgins, Michael;Tarr, Alexander
通讯作者:
Tarr, Alexander
影响因子:
1
作者:
B. Alexeev;D. Mixon
通讯作者:
D. Mixon
DOI:
10.48550/arxiv.2206.00579
发表时间:
2017
期刊:
arXiv: Applications
影响因子:
--
作者:
Sachet Bangia;Christy V. Graves;G. Herschlag;H. Kang;Justin Luo;Jonathan C. Mattingly;Robert J. Ravier
通讯作者:
Robert J. Ravier
DOI:
--
发表时间:
2017
期刊:
The American mathematical monthly
影响因子:
--
作者:
B. Alexeev;D. Mixon
通讯作者:
D. Mixon
DOI:
--
发表时间:
1974
期刊:
影响因子:
--
作者:
E. C. Griffith
通讯作者:
E. C. Griffith