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

Borda操作的复杂性及其算法

Complexity of and Algorithms for Borda Manipulation

University of Toronto(多伦多大学);LRI, Université Paris Sud 11(巴黎第十一大学LRI实验室);NICTA(国家信息与通信技术研究院);UNSW(新南威尔士大学)

Jessica Davies, George Katsirelos, Nina Narodytska, Toby Walsh

摘要:

我们证明了两个操纵者的联盟计算如何操纵Borda投票规则是NP-难的。这解决了操纵公共投票规则的计算复杂性中的最后一个公开问题。由于这种NP-困难,我们把计算操作作为一个近似问题,我们试图最大限度地减少操纵器的数量。基于装箱和多处理器调度的思想,我们提出了两个新的近似方法来计算Borda规则的操作。实验表明,这些方法的性能明显优于现有的近似方法.我们能够在几乎所有随机生成的选举测试中找到最佳操作。我们的研究结果表明,虽然计算操纵的Borda规则的联盟是NP难的,计算复杂性可能只提供了一个薄弱的障碍,在实践中操纵。

英文摘要:

We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Borda voting rule. This resolves one of the last open problems in the computational complexity of manipulating common voting rules. Because of this NP-hardness, we treat computing a manipulation as an approximation problem where we try to minimize the number of manipulators. Based on ideas from bin packing and multiprocessor scheduling, we propose two new approximation methods to compute manipulations of the Borda rule. Experiments show that these methods significantly outperform the previous best known %existing approximation method. We are able to find optimal manipulations in almost all the randomly generated elections tested. Our results suggest that, whilst computing a manipulation of the Borda rule by a coalition is NP-hard, computational complexity may provide only a weak barrier against manipulation in practice.

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

↑