通过打破平局来控制选举有多难?
How Hard Is It to Control an Election by Breaking Ties?
摘要:
我们研究了通过策略性地打破关系来控制选举结果的计算复杂性。这个问题相当于在平行宇宙中决定选举获胜者的问题。当选举主席只被要求打破联系,在共同获胜者中做出选择时,问题就变得简单了。然而,在多轮选举中,我们证明了主席计算如何打破联系以确保给定结果是NP-难的。此外,我们表明,平局打破功能的形式可以增加控制的机会。事实上,我们证明,它可以是NP-难控制的选举,即使有两个阶段的投票规则打破联系。
英文摘要:
We study the computational complexity of controlling the result of an election by breaking ties strategically. This problem is equivalent to the problem of deciding the winner of an election under parallel universes tie-breaking. When the chair of the election is only asked to break ties to choose between one of the co-winners, the problem is trivially easy. However, in multi-round elections, we prove that it can be NP-hard for the chair to compute how to break ties to ensure a given result. Additionally, we show that the form of the tie-breaking function can increase the opportunities for control. Indeed, we prove that it can be NP-hard to control an election by breaking ties even with a two-stage voting rule.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。