{"type":"ScholarlyArticle","title":"Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments","authors":[{"name":"Niclas Boehmer","slug":"niclas-boehmer","given":"Niclas","family":"Boehmer","affiliation":""},{"name":"Robert Bredereck","slug":"robert-bredereck","given":"Robert","family":"Bredereck","affiliation":""},{"name":"Piotr Faliszewski","slug":"piotr-faliszewski","given":"Piotr","family":"Faliszewski","affiliation":""},{"name":"Rolf Niedermeier","slug":"rolf-niedermeier","given":"Rolf","family":"Niedermeier","affiliation":""}],"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.","doi":"10.24963/ijcai.2021/8","url":"https://ijcai.org/proceedings/2021/8","pdf":"https://ijcai.org/proceedings/2021/0008.pdf","markdown":"https://ijcai.org/proceedings/2021/8.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/8","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":8,"pages":{"first":52,"last":58},"keywords":["Agent-based and Multi-agent Systems: Computational Social Choice","Agent-based and Multi-agent Systems: Voting"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}