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.
@article{arxiv.2010.09678,
title = {On the Robustness of Winners: Counting Briberies in Elections},
author = {Niclas Boehmer and Robert Bredereck and Piotr Faliszewski and Rolf Niedermeier},
journal= {arXiv preprint arXiv:2010.09678},
year = {2020}
}