2000 character limit reached
A Note on the Complexity of Manipulating Weighted Schulze Voting (1808.09226v2)
Published 28 Aug 2018 in cs.GT, cs.CC, and cs.MA
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.