Parameterized computational complexity of Dodgson and Young elections
We show that the two NP-complete problems of DODGSON SCORE and YOUNG SCORE have differing computational complexities when the winner is close to being a Condorcet winner. 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[2]-complete. In addition, we study Dodgson elections that allow ties between the candidates and give fixed-parameter tractability as well as W[2]-completeness results depending on the cost model for switching ties. (C) 2009 Elsevier Inc. All rights reserved.
w[2]-completeness fixed-parameter tractability computational social choice voting systems winner determination