Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting

Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting
复制标题

巴克林的操纵、贿赂和竞选管理的复杂性以及后备投票

DOI:
10.1007/s10458-014-9277-x
复制
发表时间:
2015
影响因子:
1.9
通讯作者:
L. Schend
L. Schend
中科院分区:
计算机科学4区
文献类型:
--
作者:
P. Faliszewski;Y. Reisch;J. Rothe;L. Schend

文献摘要

参考文献

被引文献

相似文献

计算社会选择的一个中心主题是研究投票系统在计算上抵抗试图影响选举结果的操纵攻击的程度,例如操纵(即,战略投票)、控制和贿赂。Bucklin和回退投票是具有最广泛阻力的投票系统之一(即,NP-硬度)来控制攻击。然而,人们对他们在操纵和贿赂攻击方面的行为知之甚少。我们全面调查的计算阻力的Bucklin和回退投票的许多常见的操纵和贿赂的情况下,我们还补充我们的讨论,考虑几个安全管理问题,这两个投票规则。
A central theme in computational social choice is to study the extent to which voting systems computationally resist manipulative attacks seeking to influence the outcome of elections, such as manipulation (i.e., strategic voting), control, and bribery. Bucklin and fallback voting are among the voting systems with the broadest resistance (i.e., NP-hardness) to control attacks. However, only little is known about their behavior regarding manipulation and bribery attacks. We comprehensively investigate the computational resistance of Bucklin and fallback voting for many of the common manipulation and bribery scenarios; we also complement our discussion by considering several campaign-management problems for these two voting rules.
批准驱动的投票规则下的竞选管理
DOI: 10.1007/s00453-015-0064-0
发表时间: 2011
期刊: Algorithmica
影响因子: 1.1
作者:
Ildikó Schlotter;Piotr Faliszewski;Edith Elkind
通讯作者: Edith Elkind
博尔达规则下的无权联合操纵是 NP 难的
DOI: --
发表时间: 2011
期刊: International Joint Conference on Artificial Intelligence
影响因子: --
作者:
Nadja Betzler;Rolf Niedermeier;G. Woeginger
通讯作者: G. Woeginger
解决选举制度中的难题
DOI: --
发表时间: 2012
期刊:
影响因子: --
作者:
E. Hemaspaandra;Andrew Lin
通讯作者: Andrew Lin
计算中的基本问题,纪念 Daniel J. Rosenkrantz 教授的论文
DOI: --
发表时间: 2009
期刊: Fundamental Problems in Computing
影响因子: --
作者:
S. Ravi;S. Shukla
通讯作者: S. Shukla
舒尔茨规则与排名对之间的策略行为复杂性比较
DOI: --
发表时间: 2012
期刊: AAAI Conference on Artificial Intelligence
影响因子: --
作者:
D. Parkes;Lirong Xia
通讯作者: Lirong Xia