更自然的分区选举控制模型
More Natural Models of Electoral Control by Partition
摘要：
“控制”研究试图通过增加、删除或分割选民或候选人来设定选举结果。基准控制类型的集合主要是在1992年由Bartholdi，Tovey和Trick介绍控制的开创性论文中设定的，现在有大量文献研究各种选举系统容易受到多少基准类型的影响，即，有多项式时间攻击算法。然而，尽管添加和删除的长期基准模型相对较好地模拟了激发它们的真实世界设置，但分区模型设置的长期基准模型可以说与它们试图捕获的设置相距甚远。在本文中，我们介绍-并在一些重要的情况下分析-新的分区模型，以寻求更好地捕捉许多现实世界的分区设置的复杂性。具体地，在许多分区设置中，人们希望分区的两个部分具有（几乎）相等的大小，或者被分区成多于两个部分，或者具有必须被放置在分区的相同部分中的参与者组。我们的希望是，这些新的分区类型将允许控制攻击的研究，包括这样的模型，更真实地捕捉许多设置。
英文摘要：
"Control" studies attempts to set the outcome of elections through the addition, deletion, or partition of voters or candidates. The set of benchmark control types was largely set in the seminal 1992 paper by Bartholdi, Tovey, and Trick that introduced control, and there now is a large literature studying how many of the benchmark types various election systems are vulnerable to, i.e., have polynomial-time attack algorithms for. However, although the longstanding benchmark models of addition and deletion model relatively well the real-world settings that inspire them, the longstanding benchmark models of partition model settings that are arguably quite distant from those they seek to capture. In this paper, we introduce--and for some important cases analyze the complexity of--new partition models that seek to better capture many real-world partition settings. In particular, in many partition settings one wants the two parts of the partition to be of (almost) equal size, or is partitioning into more than two parts, or has groups of actors who must be placed in the same part of the partition. Our hope is that having these new partition types will allow studies of control attacks to include such models that more realistically capture many settings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
