Fair redistricting is hard

被引：7
|
作者：
Kueng, Richard [1 ]
Mixon, Dustin G. [2 ]
Villar, Soledad [3 ,4 ]
机构：
[1] CALTECH, Inst Quantum Informat & Matter, Pasadena, CA 91125 USA
[2] Ohio State Univ, Dept Math, 231 W 18th Ave, Columbus, OH 43210 USA
[3] NYU, Courant Inst Math Sci, New York, NY USA
[4] NYU, Ctr Data Sci, New York, NY USA
来源：
THEORETICAL COMPUTER SCIENCE | 2019年 / 791卷
关键词：
NP-hard; Computational complexity; Gerrymandering; MEASURING COMPACTNESS; MARKOV-CHAIN; PARTISAN;
D O I：
10.1016/j.tcs.2019.04.004
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码：28 / 35
页数：8
相关论文
共 50 条
  • [1] A fair division solution to the problem of redistricting
    Z. Landau
    O. Reid
    I. Yershov
    Social Choice and Welfare, 2009, 32 : 479 - 492
  • [2] A fair division solution to the problem of redistricting
    Landau, Z.
    Reid, O.
    Yershov, I.
    SOCIAL CHOICE AND WELFARE, 2009, 32 (03) : 479 - 492
  • [3] Trade-Offs in Fair Redistricting
    Schutzman, Zachary
    PROCEEDINGS OF THE 3RD AAAI/ACM CONFERENCE ON AI, ETHICS, AND SOCIETY AIES 2020, 2020, : 159 - 165
  • [4] A Reinforcement Learning Algorithm for Fair Electoral Redistricting in Parliamentary Systems
    Evans, Callum
    Barbosa, Hugo
    MACHINE LEARNING AND PRINCIPLES AND PRACTICE OF KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2022, PT I, 2023, 1752 : 167 - 180
  • [5] Courses are hard but fair
    Peachey, A
    PROFESSIONAL ENGINEERING, 1998, 11 (11) : 37 - 37
  • [6] MAKING THE HARD CHOICES FAIR CHOICES
    HARTZOG, J
    ACADEME-BULLETIN OF THE AAUP, 1993, 79 (04): : 31 - 33
  • [7] Why it's so hard to be fair
    Brockner, J
    HARVARD BUSINESS REVIEW, 2006, 84 (03) : 122 - +
  • [8] REDISTRICTING
    CRAIG, WJ
    ANNALS OF THE ASSOCIATION OF AMERICAN GEOGRAPHERS, 1977, 67 (04) : 641 - 643
  • [9] Adventures in Redistricting: A Look at the California Redistricting Commission
    Mac Donald, Karin
    ELECTION LAW JOURNAL, 2012, 11 (04): : 472 - 489
  • [10] Fair Division Is Hard Even for Amicable Agents
    Misra, Neeldhara
    Sethia, Aditi
    SOFSEM 2021: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2021, 12607 : 421 - 430
12345