19/08/2021

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

Niclas Boehmer, Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier

Keywords: Agent-based and Multi-agent Systems, Computational Social Choice, Voting

Abstract Paper Similar Papers

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.

 0
 0
 0
 0
  Share    
This is an embedded video. Talk and the respective paper are published at IJCAI 2021 virtual conference. If you are one of the authors of the paper and want to manage your upload, see the question "My papertalk has been externally embedded..." in the FAQ section.

Comments

Post Comment
no comments yet
code of conduct: tbd Characters remaining: 140

Similar Papers

 0
 0
 0
 0
 8:42 
 0
 0
 0
 0
 20:36 
 0
 0
 0
 0
 18:16 
 0
 0
 0
 0
 19:36 
 0
 0
 0
 0
 16:47 
 0
 0
 0
 0
 14:52 
 0
 0
 0
 0
 15:05 
 0
 0
 0
 0
 14:19 
 0
 0
 0
 0
 19:52 
 0
 0
 0
 0
 15:55 
 0
 0
 0
 0
 14:45 
 0
 0
 0
 0
 14:22 
 0
 0
 0
 0
 21:04 
 0
 0
 0
 0
 15:38 
 0
 0
 0
 0
 18:22 
 0
 0
 0
 0
 11:46 
 0
 0
 0
 0
 20:14 
 0
 0
 0
 0
 18:58 
 0
 0
 0
 0
 10:33 
 0
 0
 0
 0
 4:54 
 0
 0
 0
 0
 18:46 
 0
 0
 0
 0
 3:21 
 0
 0
 0
 0
 2:55 
 0
 0
 0
 0
 3:25 
 0
 0
 0
 0
 24:55 
 0
 0
 0
 0
 12:28 
 0
 0
 0
 0
 14:02 
 0
 0
 0
 0
 4:52 
 0
 0
 0
 0
 20:02 
 0
 0
 0
 0
 10:44 
 0
 0
 0
 0
 12:25 
 0
 0
 0
 0
 5:16 
 0
 0
 0
 1
 5:39 
 0
 0
 0
 0
 3:22 
 0
 0
 0
 0
 14:27 
 0
 0
 0
 0
 11:07 
 0
 0
 0
 0
 15:47 
 0
 0
 0
 0
 14:24 
 0
 0
 0
 0
 15:40 
 0
 0
 0
 0
 18:18