Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments
We study the parameterized complexity of counting variants of Swap- and Shift-Bribery, focusing on the parameterizations by the number of swaps and the number of voters. Facing several computational hardness results, using sampling we show experimentally that Swap-Bribery offers a new approach to the robustness analysis of elections.
2019 ◽
Vol 33
◽
pp. 2827-2834
◽
Keyword(s):
1999 ◽
Vol 173
◽
pp. 185-188
Keyword(s):
1973 ◽
Vol 31
◽
pp. 698-699
Keyword(s):
1985 ◽
Vol 43
◽
pp. 714-715
Keyword(s):
1989 ◽
Vol 47
◽
pp. 76-77
1968 ◽
Vol 32
(3)
◽
pp. 279-282