精确IRV边缘的高效计算
Efficient Computation of Exact IRV Margins
摘要：
许多选举方案的获胜幅度很容易计算，但即时决选（IRV）很难计算。这一点很重要，因为关于选举结果正确性的争论通常取决于选举差额的大小。例如，风险限制审计需要了解胜利的边际，以确定需要进行多少审计。本文提出了一种实用的分支定界算法的精确IRV余量计算，大大提高了目前最知名的方法。虽然在最坏的情况下是指数级的，但我们的算法在实践中对我们能找到的所有真实示例都有效地运行。我们可以有效地发现当前最先进技术无法解决的选举实例的确切差额。
英文摘要：
The margin of victory is easy to compute for many election schemes but difficult for Instant Runoff Voting (IRV). This is important because arguments about the correctness of an election outcome usually rely on the size of the electoral margin. For example, risk-limiting audits require a knowledge of the margin of victory in order to determine how much auditing is necessary. This paper presents a practical branch-and-bound algorithm for exact IRV margin computation that substantially improves on the current best-known approach. Although exponential in the worst case, our algorithm runs efficiently in practice on all the real examples we could find. We can efficiently discover exact margins on election instances that cannot be solved by the current state-of-the-art.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
