arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1405.7714cs.GTcs.AI
收藏

部分投票对策略投票的计算影响

The Computational Impact of Partial Votes on Strategic Voting

University of Toronto(多伦多大学);UNSW(新南威尔士大学);NICTA(澳大利亚国家信息与通信技术研究院)

Nina Narodytska, Toby Walsh

摘要:

在许多真实世界的选举中,代理人不需要对所有候选人进行排名。我们研究了三种最常用的方法来修改投票规则,以处理这样的部分投票。这些方法分别修改了评分规则(如Borda计数)、淘汰式规则(如单可转移投票)和基于锦标赛图的规则(如Copeland)。我们认为,淘汰式投票规则,如单一可转移投票,部分投票并没有改变的情况下,战略投票是可能的。然而,评分规则和规则的基础上的比赛图,部分投票可以增加的情况下,战略投票是可能的。因此,计算战略投票的计算复杂性可以改变。例如,使用Borda计数,计算战略投票的复杂性可以降低或保持不变,这取决于我们如何对部分投票进行评分。

英文摘要:

In many real world elections, agents are not required to rank all candidates. We study three of the most common methods used to modify voting rules to deal with such partial votes. These methods modify scoring rules (like the Borda count), elimination style rules (like single transferable vote) and rules based on the tournament graph (like Copeland) respectively. We argue that with an elimination style voting rule like single transferable vote, partial voting does not change the situations where strategic voting is possible. However, with scoring rules and rules based on the tournament graph, partial voting can increase the situations where strategic voting is possible. As a consequence, the computational complexity of computing a strategic vote can change. For example, with Borda count, the complexity of computing a strategic vote can decrease or stay the same depending on how we score partial votes.

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

↑