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.

中文翻译：

---

关于操纵加权舒尔茨投票的复杂性的说明

我们证明，对于无数个候选人和无数个操纵者，可以在多项式时间内解决Schulze投票规则的构造性加权联合操纵问题。