---
title: "Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments"
authors:
  - "Niclas Boehmer"
  - "Robert Bredereck"
  - "Piotr Faliszewski"
  - "Rolf Niedermeier"
doi: "10.24963/ijcai.2021/8"
url: "https://ijcai.org/proceedings/2021/8"
pdf: "https://ijcai.org/proceedings/2021/0008.pdf"
venue: "Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"
year: 2021
pages: "52-58"
track: "Main Track"
keywords:
  - "Agent-based and Multi-agent Systems: Computational Social Choice"
  - "Agent-based and Multi-agent Systems: Voting"
---

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

Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier

*Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence*, pages 52-58. DOI: [10.24963/ijcai.2021/8](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.