Winner Robustness via Swap- and Shift-Bribery: Parameterized Counting Complexity and Experiments-Reference-Cited by-同舟云学术

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

Published:2021-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
language:
Short-container-title:

Author:

Boehmer Niclas¹,Bredereck Robert²,Faliszewski Piotr³,Niedermeier Rolf¹

Affiliation:

1. Algorithmics and Computational Complexity, TU Berlin, Germany

2. Humboldt-Universität zu Berlin, Germany

3. AGH University, Poland

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.

Publisher

International Joint Conferences on Artificial Intelligence Organization

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Complexity of Predicting Election Outcomes and Estimating Their Robustness;SN Computer Science;2023-04-28

2. Fine-grained view on bribery for group identification;Autonomous Agents and Multi-Agent Systems;2023-03-24

3. Robustness of Participatory Budgeting Outcomes: Complexity and Experiments;Algorithmic Game Theory;2023

4. A Quantitative and Qualitative Analysis of the Robustness of (Real-World) Election Winners;Equity and Access in Algorithms, Mechanisms, and Optimization;2022-10-06

5. Complexity of shift bribery for iterative voting rules;Annals of Mathematics and Artificial Intelligence;2022-08-09