Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
Katar\'ina Cechl\'arov\'a, J\"org Rothe, \v{S}imon Schierreich, Ildik\'o Schlotter

TL;DR
This paper analyzes the computational complexity of nominee selection problems in Schulze voting, providing detailed parameterized complexity results and dichotomies based on election parameters.
Contribution
It offers a comprehensive parameterized complexity analysis of Possible President and Necessary President problems, improving upon prior NP and coNP completeness results.
Findings
Determined parameterized complexity with respect to voters, party size, and number of parties.
Established dichotomies for the problems based on the number of voters.
Provided a finer analysis of the complexity landscape for Schulze voting nominee problems.
Abstract
We study the Possible President problem and the Necessary President problem for Schulze voting, a rule that, due to its many desirable axiomatic properties, is popular in practice. In both problems, we are given an election with the candidates partitioned into a set of parties, and we are interested in questions about a given distinguished party. In the Possible President problem, we ask whether it is possible for the parties to each nominate exactly one candidate such that the nominee of the distinguished party is a Schulze winner of the resulting election with only the nominees running. In the Necessary President problem, we ask whether the distinguished party's nominee is a Schulze winner of the resulting election, irrespective of the nomination from the other parties. Rothe and Woitaschik have shown that Possible President is NP-complete and Necessary President is coNP-complete for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
