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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 208; číslo 2; s. 165 - 177
Hlavní autori:	Betzler, Nadja, Guo, Jiong, Niedermeier, Rolf
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier Inc 01.02.2010 Elsevier
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!