On the Robustness of Winners: Counting Briberies in Elections

10/19/2020

∙

by   Niclas Boehmer, et al.

∙

0

∙

share

We study the parameterized complexity of counting variants of Swap- and Shift-Bribery problems, focusing on the parameterizations by the number of swaps and the number of voters. We show experimentally that Swap-Bribery offers a new approach to the robustness analysis of elections.