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

Verfasser / Beitragende:
[Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend]
Ort, Verlag, Jahr:
2015
Enthalten in:
Autonomous Agents and Multi-Agent Systems, 29/6(2015-11-01), 1091-1124
Format:
Artikel (online)
ID: 605514690
LEADER caa a22 4500
001 605514690
003 CHVBK
005 20210128100705.0
007 cr unu---uuuuu
008 210128e20151101xx s 000 0 eng
024 7 0 |a 10.1007/s10458-014-9277-x  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s10458-014-9277-x 
245 0 0 |a Complexity of manipulation, bribery, and campaign management in Bucklin and fallback voting  |h [Elektronische Daten]  |c [Piotr Faliszewski, Yannick Reisch, Jörg Rothe, Lena Schend] 
520 3 |a 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. 
540 |a The Author(s), 2014 
690 7 |a Computational social choice  |2 nationallicence 
690 7 |a Complexity theory  |2 nationallicence 
690 7 |a Voting theory  |2 nationallicence 
690 7 |a Manipulation  |2 nationallicence 
690 7 |a Bribery  |2 nationallicence 
690 7 |a Campaign management  |2 nationallicence 
690 7 |a Bucklin voting  |2 nationallicence 
690 7 |a Fallback voting  |2 nationallicence 
700 1 |a Faliszewski  |D Piotr  |u AGH University, Krakow, Poland  |4 aut 
700 1 |a Reisch  |D Yannick  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
700 1 |a Rothe  |D Jörg  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
700 1 |a Schend  |D Lena  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
773 0 |t Autonomous Agents and Multi-Agent Systems  |d Springer US; http://www.springer-ny.com  |g 29/6(2015-11-01), 1091-1124  |x 1387-2532  |q 29:6<1091  |1 2015  |2 29  |o 10458 
856 4 0 |u https://doi.org/10.1007/s10458-014-9277-x  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s10458-014-9277-x  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Faliszewski  |D Piotr  |u AGH University, Krakow, Poland  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Reisch  |D Yannick  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Rothe  |D Jörg  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Schend  |D Lena  |u Heinrich-Heine-Universität Düsseldorf, Düsseldorf, Germany  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Autonomous Agents and Multi-Agent Systems  |d Springer US; http://www.springer-ny.com  |g 29/6(2015-11-01), 1091-1124  |x 1387-2532  |q 29:6<1091  |1 2015  |2 29  |o 10458