# Algorithms for Destructive Shift Bribery

3 Oct 2018

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 best to the worst), a despised candidate $d$, a budget $B$, and prices for shifting $d$ back in the voters' rankings... (read more)

PDF Abstract

# Code Add Remove Mark official

No code implementations yet. Submit your code now