arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.13868cs.DScs.DMmath.CO
收藏

算法化选区重划的一致随机解

A Uniformly Random Solution to Algorithmic Redistricting

Jin-Yi Cai, Jacob Kruse, Kenneth Mayer, Daniel P. Szabo

AI总结:

本文提出一种确定性次指数时间算法,从有界度平面图的所有 $k$-划分空间中一致采样选区重划方案,并可加入紧凑性与人口约束,从而为检测不公正划分选区提供更全面的采样基础。

摘要:

划分选区边界的过程被称为政治选区重划。在这一背景下,不公正划分选区(gerrymandering)是指以不公平地偏袒某一特定政党的方式划定边界,常常导致代表性不平等和扭曲的选举结果。检测不公正划分选区的少数方法之一是通过算法对选区重划方案进行采样。以往的方法主要侧重于从某些“现实”选区划分方案的邻域中进行采样,而不是从整个空间进行一致采样。我们提出了一种确定性的次指数时间算法,用于从有界度平面图的所有可能 $k$-划分空间中一致采样,并借此构造整个选区重划方案空间的样本。我们还给出了一种方法,可以在增加复杂性的代价下,将该样本空间限制为满足某些紧凑性和人口约束的方案。该算法的运行时间为 $2^{O(\sqrt{n}\log n)}$,尽管我们只给出了启发式实现。我们的方法推广了一种在方格上计数自避行走的算法,用于计数将一般平面图分割成 $k$ 个区域的路径,并利用这一方法从平面图的所有 $k$-划分空间中进行采样。

英文摘要:

The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that they unfairly favor a particular political party, often leading to unequal representation and skewed electoral outcomes. One of the few ways to detect gerrymandering is by algorithmically sampling redistricting plans. Previous methods mainly focus on sampling from some neighborhood of ``realistic' districting plans, rather than a uniform sample of the entire space. We present a deterministic subexponential time algorithm to uniformly sample from the space of all possible $ k $-partitions of a bounded degree planar graph, and with this construct a sample of the entire space of redistricting plans. We also give a way to restrict this sample space to plans that match certain compactness and population constraints at the cost of added complexity. The algorithm runs in $ 2^{O(\sqrt{n}\log n)} $ time, although we only give a heuristic implementation. Our method generalizes an algorithm to count self-avoiding walks on a square to count paths that split general planar graphs into $ k $ regions, and uses this to sample from the space of all $ k $-partitions of a planar graph.

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

↑