Schulze and ranked-pairs elections have received attention recently, with the former having quickly become the most widely used Condorcet method. For many cases these systems have been proven resistant to bribery, control, and manipulation, with ranked pairs being particularly praised for being NP-hard for all three of those. Nonetheless, the present paper shows that with respect to the number of candidates, both Schulze and ranked-pairs elections are fixed-parameter tractable to bribe, control, and manipulate: we obtain uniform, polynomial-time algorithms whose degree does not depend on the number of candidates.
View on arXiv