Combinatorial voter control in elections
From MaRDI portal
Publication:2346381
DOI10.1016/j.tcs.2015.04.023zbMath1318.91057WikidataQ62039072 ScholiaQ62039072MaRDI QIDQ2346381
Rolf Niedermeier, Piotr Faliszewski, Laurent Bulteau, Jiehua Chen, Nimrod Talmon
Publication date: 1 June 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.04.023
voting; plurality rule; parameterized complexity; domain restrictions; Condorcet's rule; NP-hard election control problem
68Q25: Analysis of algorithms and problem complexity
91B12: Voting theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Uses Software