On the Hardness of Bribery Variants in Voting with CP-Nets
arXiv:1410.5186 · doi:10.1007/s10472-015-9469-3
Abstract
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 which they study the computational complexity of bribery schemes when voters have conditional preferences that are modeled by CP-nets. For most of the cases they considered, they could show that the bribery problem is solvable in polynomial time. Some cases remained open---we solve two of them and extend the previous results to the case that voters are weighted. Moreover, we consider negative (weighted) bribery in CP-nets, when the briber is not allowed to pay voters to vote for his preferred candidate.
improved readability; identified Cheapest Subsets to be the enumeration variant of K.th Largest Subset, so we renamed it to K-Smallest Subsets and point to the literatur; some more typos fixed