A Note on the Complexity of Manipulating Weighted Schulze Voting
Computer Science and Game Theory
2020-07-31 v2 Computational Complexity
Multiagent Systems
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.
Keywords
Cite
@article{arxiv.1808.09226,
title = {A Note on the Complexity of Manipulating Weighted Schulze Voting},
author = {Julian Müller and Sven Kosub},
journal= {arXiv preprint arXiv:1808.09226},
year = {2020}
}
Comments
Accepted manuscript; proof of Lemma 8 corrected