How Hard Is Bribery in Elections?
From MaRDI portal
Publication:3651470
DOI10.1613/jair.2676zbMath1180.91090MaRDI QIDQ3651470
Hemaspaandra, Lane A., Edith Hemaspaandra, Piotr Faliszewski
Publication date: 10 December 2009
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.2676
91B12: Voting theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners, Algorithms for the coalitional manipulation problem, Anyone but him: the complexity of precluding an alternative, Parameterized computational complexity of control problems in voting systems, Parameterized complexity of candidate control in elections and related digraph problems, Hybrid Elections Broaden Complexity-Theoretic Resistance to Control, Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control