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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information and computation Jg. 208; H. 2; S. 165 - 177
Hauptverfasser:	Betzler, Nadja, Guo, Jiong, Niedermeier, Rolf
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier Inc 01.02.2010 Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!