On the Robustness of Winners: Counting Briberies in Elections

Cited by: 0|Views17

Abstract:

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.

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments