A Note on the Complexity of Manipulating Weighted Schulze Voting

TL;DR

This paper demonstrates that the problem of manipulating weighted Schulze voting can be efficiently solved in polynomial time, even with unlimited candidates and manipulators, challenging previous assumptions about its complexity.

Contribution

It proves that the constructive weighted coalitional manipulation problem for Schulze voting is solvable in polynomial time regardless of the number of candidates and manipulators.

Findings

Manipulation problem is polynomial-time solvable

Unbounded candidates and manipulators do not increase complexity

Challenges previous complexity assumptions

Abstract

We prove that the constructive weighted coalitional manipulation problem for the Schulze voting rule can be solved in polynomial time for an unbounded number of candidates and an unbounded number of manipulators.