Proceedings

Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments

Download BibTeX Cite

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. Main Track. Pages 52-58.

https://doi.org/10.24963/ijcai.2021/8

Abstract

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.

Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, and Rolf Niedermeier. 2021. Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21. IJCAI, 52–58. https://doi.org/10.24963/ijcai.2021/8
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards