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 m...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 208; no. 2; pp. 165 - 177
Main Authors:	Betzler, Nadja, Guo, Jiong, Niedermeier, Rolf
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 01.02.2010 Elsevier
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computational social choice Computer science; control theory; systems Exact sciences and technology Fixed-parameter tractability Miscellaneous Theoretical computing Voting systems W-completeness Winner determination Winner determination Computational social choice W-completeness Fixed-parameter tractability Voting systems Costs Computer theory Algorithm Computational complexity Switching Voting Completeness NP complete problem
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!