A Note on the Complexity of Manipulating Weighted Schulze Voting
arXiv:1808.09226 · doi:10.1016/j.ipl.2020.105989
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.
Accepted manuscript; proof of Lemma 8 corrected