arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2006.05460math.PRcs.GTecon.THmath.CO
收藏

设计稳定的选举:一项调查

Designing Stable Elections: A Survey

Steven Heilman

摘要:

我们调查选举的设计,是弹性的企图干预第三方。例如,假设在两个候选人之间的选举中投票,然后每个选票都以小概率随机改变,独立于其他选票。无论选票如何变化,都希望选举结果保持不变。众所周知,与多数票相比,美国选举人团制度因投票腐败而改变结果的可能性约为5倍。事实上,Mossel,O'Donnell和Oleszkiewicz在2005年证明了多数投票法对这种随机投票腐败最稳定,在每个人对选举的影响很小的投票方法中。我们讨论了一些最近的进展,在两个以上的候选人之间的选举类似的结果。在这种情况下,多数应该是最稳定的腐败选票。我们还调查了对抗性选举操纵的结果(对手可以选择特定的选票来改变,也许是以非随机的方式),我们简要讨论了排名选择投票方法(投票是候选人的排名列表)。

英文摘要:

We survey the design of elections that are resilient to attempted interference by third parties. For example, suppose votes have been cast in an election between two candidates, and then each vote is randomly changed with a small probability, independently of the other votes. It is desirable to keep the outcome of the election the same, regardless of the changes to the votes. It is well known that the US electoral college system is about 5 times more likely to have a changed outcome due to vote corruption, when compared to a majority vote. In fact, Mossel, O'Donnell and Oleszkiewicz proved in 2005 that the majority voting method is most stable to this random vote corruption, among voting methods where each person has a small influence on the election. We discuss some recent progress on the analogous result for elections between more than two candidates. In this case, plurality should be most stable to corruption in votes. We also survey results on adversarial election manipulation (where an adversary can select particular votes to change, perhaps in a non-random way), and we briefly discuss ranked choice voting methods (where a vote is a ranked list of candidates).

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

↑