Determining the winner of a Dodgson election is hard

From MaRDI portal

Publication:2908877

Jump to:navigation, search

DOI10.4230/LIPIcs.FSTTCS.2010.459zbMath1245.68091OpenAlexW1572190290MaRDI QIDQ2908877

Saket Saurabh, Daniel Lokshtanov, Bart M. P. Jansen, Frances A. Rosamond, Michael R. Fellows

Publication date: 29 August 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2207.html

zbMATH Keywords

parameterized complexity kernelization lower bounds Dodgson score

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Studies in Computational Aspects of Voting ⋮ Prices matter for the parameterized complexity of shift bribery

This page was built for publication: Determining the winner of a Dodgson election is hard

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2908877&oldid=15876814"