arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.08905cs.CCcs.DS
收藏

公平的重新划分选区很难

Fair redistricting is hard

Richard Kueng, Dustin G. Mixon, Soledad Villar

摘要:

Gerrymandering是美国政治体系中一个长期存在的问题,最近受到美国最高法院的审查。本文证明了判定合法地图之间是否存在公平重划是NP困难的。为了使这一点更精确,我们使用简化的“合法”和“公平”的概念,这些概念解释了理想的特征,如地区的地理紧凑性和选民的充分代表性。我们的结果的证明受到Mahanjan,Minbhorkar和Varadarajan的工作的启发,证明了平面k-means是NP-难的。

英文摘要:

Gerrymandering is a long-standing issue within the U.S. political system, and it has received scrutiny recently by the U.S. 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑