Parameterized Computational Complexity of Dodgson and Young Elections

DOI10.1007/978-3-540-69903-3_36zbMath1155.91340MaRDI QIDQ3512476

Rolf Niedermeier, Jiong Guo, Nadja Betzler

Publication date: 15 July 2008

Published in: Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69903-3_36

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W05: Nonnumerical algorithms

91B12: Voting theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)