arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.01565cs.CCcs.CGcs.DMmath.COphysics.soc-ph
收藏

论选区重划中的党派偏见:计算复杂性与选区划分科学的相遇

On partisan bias in redistricting: computational complexity meets the science of gerrymandering

Tanima Chatterjee, Bhaskar DasGupta

摘要:

本文的主题是“gerrymandering”,即故意创造具有高度不对称选举结果的地区地图以剥夺选民权利的诅咒,它有着悠久的法律历史。衡量和消除不公正划分选区对维持社会民主原则的支柱具有巨大影响。虽然多年来并不缺乏涉及不公正划分选区的法律摘要,但直到最近,数学家和应用计算研究人员才开始研究这个问题。然而,到目前为止,计算复杂性研究人员对计算复杂性问题的理论分析,如计算难度,可逼近性问题等,关注相对较少。这可能有很多原因,如这些问题的描述非CS非数学(通常是法律或政治)杂志,理论CS(TCS)的人通常不遵循,或缺乏这些主题的报道在TCS出版场所。我们写这篇文章的一个适度的目标是通过刺激选区划分和TCS研究人员之间的进一步互动来改善这种情况。为此,我们的主要贡献是两方面的:(1)我们提供了形式化的几个模型,相关的概念,并使用TCS框架,这些问题的描述,在现有的非TCS(也许是合法的)场所,和(2)我们还提供了这些问题的一些版本的计算复杂性分析,留下其他版本的未来研究。写这篇文章的目的不是对不公正划分选区做出最终决定,而是向TCS社区介绍一系列概念、模型和问题,并表明不公正划分选区的科学涉及一系列有趣的划分问题,这些问题涉及几何和组合优化。

英文摘要:

The topic of this paper is "gerrymandering", namely the curse of deliberate creations of district maps with highly asymmetric electoral outcomes to disenfranchise voters, and it has a long legal history. Measuring and eliminating gerrymandering has enormous implications to sustain the backbone of democratic principles of a society. Although there is no dearth of legal briefs involving gerrymandering over many years, it is only more recently that mathematicians and applied computational researchers have started to investigate this topic. However, it has received relatively little attention so far from the computational complexity researchers dealing with theoretical analysis of computational complexity issues, such as computational hardness, approximability issues, etc. There could be many reasons for this, such as descriptions of these problem non-CS non-math (often legal or political) journals that theoretical CS (TCS) people usually do not follow, or the lack of coverage of these topics in TCS publication venues. One of our modest goals in writing this article is to improve upon this situation by stimulating further interactions between the gerrymandering and TCS researchers. To this effect, our main contributions are twofold: (1) we provide formalization of several models, related concepts, and corresponding problem statements using TCS frameworks from the descriptions of these problems as available in existing non-TCS (perhaps legal) venues, and (2) we also provide computational complexity analysis of some versions of these problems, leaving other versions for future research. The goal of writing this article is not to have the final word on gerrymandering, but to introduce a series of concepts, models and problems to the TCS community and to show that science of gerrymandering involves an intriguing set of partitioning problems involving geometric and combinatorial optimization.

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

↑