Determining the Winner of a Dodgson Election is Hard

Michael Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond & Saket Saurabh
Computing the Dodgson Score of a candidate in an election is a hard computational problem, which has been analyzed using classical and parameterized analysis. In this paper we resolve two open problems regarding the parameterized complexity of DODGSON SCORE. We show that DODGSON SCORE parameterized by the target score value $k$ does not have a polynomial kernel unless the polynomial hierarchy collapses to the third level; this complements a result of Fellows, Rosamond and Slinko...
This data center is not currently reporting usage information. For information on how your repository can submit usage information, please see our Documentation.