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
中科院分区:
文献类型:
--
作者:
P. Faliszewski;Y. Reisch;J. Rothe;L. Schend
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.
登录
查看更多内容
影响因子:
1.1
作者:
Ildikó Schlotter;Piotr Faliszewski;Edith Elkind
通讯作者:
Edith Elkind
DOI:
--
发表时间:
2011
期刊:
International Joint Conference on Artificial Intelligence
影响因子:
--
作者:
Nadja Betzler;Rolf Niedermeier;G. Woeginger
通讯作者:
G. Woeginger
DOI:
--
发表时间:
2012
期刊:
影响因子:
--
作者:
E. Hemaspaandra;Andrew Lin
通讯作者:
Andrew Lin
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