13 citations · 17 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.AI2018★ 13 cited
Algorithms for Destructive Shift Bribery
Andrzej Kaczmarczyk, Piotr Faliszewski
We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (each ranking the candidates from the b…
cs.MA2018
On Coalitional Manipulation for Multiwinner Elections: Shortlisting
Robert Bredereck, Andrzej Kaczmarczyk, Rolf Niedermeier
Shortlisting of candidates--selecting a group of "best" candidates--is a special case of multiwinner elections. We provide the first in-depth study of the computational complexity…