Determining the winner of a Dodgson election is hard

DOI10.4230/LIPICS.FSTTCS.2010.459zbMATH Open1245.68091OpenAlexW1572190290MaRDI QIDQ2908877FDOQ2908877

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

Publication date: 29 August 2012

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

Recommendations

• Parameterized computational complexity of Dodgson and Young elections
• Parameterized Computational Complexity of Dodgson and Young Elections
• Election score can be harder than winner
• On the approximability of Dodgson and Young elections
• On the approximability of Dodgson and Young elections

zbMATH Keywords

parameterized complexitykernelization lower boundsDodgson score

Mathematics Subject Classification ID

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

Cited In (5)

• Studies in Computational Aspects of Voting
• Parameterized computational complexity of Dodgson and Young elections
• Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
• Prices matter for the parameterized complexity of shift bribery
• Election score can be harder than winner

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908877)