Parameterized Computational Complexity of Dodgson and Young Elections
We show that, other than for standard complexity theory with known NP-completeness results, the computational complexity of the Dodgson and Young election systems is completely different from a parameterized complexity point of view. That is, on the one hand, we present an efficient fixed-parameter algorithm for determining a Condorcet winner in Dodgson elections by a minimum number of switches in the votes. On the other hand, we prove that the corresponding problem for Young elections, where one has to delete votes instead of performing switches, is W-complete. In addition, we study Dodgson elections that allow ties between the candidates and give fixed-parameter tractability as well as W-hardness results depending on the cost model for switching ties.
Unable to display preview. Download preview PDF.