[Paper Review] Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control

Lane A. Hemaspaandra, Rahman Lavaee+1 more|arXiv (Cornell University)|May 6, 2013

Internet Traffic Analysis and Secure E-votingComputer Science34 references18 citations

TL;DR

This paper demonstrates that Schulze and ranked-pairs voting systems are fixed-parameter tractable (FPT) with respect to the number of candidates for bribery, control, and manipulation. By exploiting the structural properties of these systems, the authors present uniform polynomial-time algorithms whose runtime depends only on the number of candidates, not on the number of voters, offering efficient solutions for small candidate sets.

ABSTRACT

Schulze and ranked-pairs elections have received attention recently, with the former having quickly become a widely used election system. 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, this work 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 can obtain uniform, polynomial-time algorithms whose degree does not depend on the number of candidates.

Motivation & Objective

• To investigate the parameterized complexity of bribery, control, and manipulation in Schulze and ranked-pairs voting systems.
• To determine whether these systems, though NP-hard in general, become tractable when parameterized by the number of candidates.
• To develop uniform, polynomial-time algorithms for all three types of electoral attacks that depend only on the number of candidates.

Proposed method

• The authors analyze the structural properties of Schulze and ranked-pairs elections to identify fixed-parameter tractable (FPT) algorithms.
• They apply parameterized complexity theory, focusing on the number of candidates as the parameter, to derive efficient algorithms.
• The approach leverages the fact that both systems rely on transitive, pairwise comparisons and dominance structures that can be computed efficiently for small candidate sets.
• The algorithms are designed to be uniform across all three types of attacks—bribery, control, and manipulation—using the same core computational framework.
• The runtime of the algorithms is polynomial in the number of voters but only depends on the number of candidates, ensuring scalability for small candidate sets.

Experimental results

Research questions

• RQ1 Can bribery in Schulze and ranked-pairs elections be solved in fixed-parameter tractable time when parameterized by the number of candidates?
• RQ2 Is control over Schulze and ranked-pairs elections fixed-parameter tractable with respect to the number of candidates?
• RQ3 Can manipulation of these systems also be solved efficiently when the number of candidates is small?
• RQ4 Do the same algorithmic techniques apply uniformly across bribery, control, and manipulation in these systems?

Key findings

• Schulze and ranked-pairs elections are fixed-parameter tractable for bribery, control, and manipulation when parameterized by the number of candidates.
• The proposed algorithms run in polynomial time with respect to the number of voters, but their degree is independent of the number of voters and depends only on the number of candidates.
• The runtime is uniform across all three types of attacks—bribery, control, and manipulation—using the same underlying computational framework.
• Despite the NP-hardness of these problems in general, efficient solutions exist when the number of candidates is small, making the systems practically tractable in many real-world scenarios.