2 papers
cs.GT2020
Algorithmic Techniques for Necessary and Possible Winners
Vishal Chakraborty, Theo Delemazure, Benny Kimelfeld +3
We investigate the practical aspects of computing the necessary and possible winners in elections over incomplete voter preferences. In the case of the necessary winners, we show h…
cs.GT2020
The Complexity of Possible Winners on Partial Chains
Vishal Chakraborty, Phokion G. Kolaitis
The Possible Winner (PW) problem, a fundamental algorithmic problem in computational social choice, concerns elections where voters express only partial preferences between candida…