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

Niclas Boehmer; Robert Bredereck; Piotr Faliszewski; Rolf Niedermeier

IJCAI 2021poster27 citations

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

Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier

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.

Agent-based and Multi-agent Systems: Computational Social ChoiceAgent-based and Multi-agent Systems: Voting

BibTeX

@inproceedings{ijcai2021p8,
  title     = {Winner Robustness via Swap- and Shift-Bribery: Parameterized  Counting Complexity and Experiments},
  author    = {Boehmer, Niclas and Bredereck, Robert and Faliszewski, Piotr and Niedermeier, Rolf},
  booktitle = {Proceedings of the Thirtieth International Joint Conference on
               Artificial Intelligence, {IJCAI-21}},
  publisher = {International Joint Conferences on Artificial Intelligence Organization},
  editor    = {Zhi-Hua Zhou},
  pages     = {52--58},
  year      = {2021},
  month     = {8},
  note      = {Main Track},
  doi       = {10.24963/ijcai.2021/8},
  url       = {https://doi.org/10.24963/ijcai.2021/8},
}