5 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.CC2015★ 2 cited
Often harder than in the Constructive Case: Destructive Bribery in CP-nets
Britta Dorn, Dominikus Krüger, Patrick Scharpfenecker
We study the complexity of the destructive bribery problem---an external agent tries to prevent a disliked candidate from winning by bribery actions---in voting over combinatorial…
cs.GT2014★ 5 cited
On the Hardness of Bribery Variants in Voting with CP-Nets
Britta Dorn, Dominikus Krüger
We continue previous work by Mattei et al. (Mattei, N., Pini, M., Rossi, F., Venable, K.: Bribery in voting with CP-nets. Ann. of Math. and Artif. Intell. pp. 1--26 (2013)) in whic…