Borda操纵的实证研究
An Empirical Study of Borda Manipulation
摘要：
我们研究的问题，联盟操纵选举使用未加权Borda规则。我们提供了经验证据的操纵性的Borda选举的形式，两个新的贪婪的操作算法的基础上的直觉装箱和多处理器调度域。虽然我们还没有能够证明这些算法在最坏的情况下击败现有的方法，我们的经验评估表明，他们显着优于现有的方法，并能够找到我们测试的随机生成的选举中的绝大多数的最佳操作。这些实证结果进一步证明，Borda规则对联盟操纵几乎没有提供任何防御。
英文摘要：
We study the problem of coalitional manipulation in elections using the unweighted Borda rule. We provide empirical evidence of the manipulability of Borda elections in the form of two new greedy manipulation algorithms based on intuitions from the bin-packing and multiprocessor scheduling domains. Although we have not been able to show that these algorithms beat existing methods in the worst-case, our empirical evaluation shows that they significantly outperform the existing method and are able to find optimal manipulations in the vast majority of the randomly generated elections that we tested. These empirical results provide further evidence that the Borda rule provides little defense against coalitional manipulation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
