Large-Scale Election Campaigns: Combinatorial Shift Bribery

DOI10.1613/jair.4927zbMath1352.68094OpenAlexW2299059564MaRDI QIDQ2800947

Rolf Niedermeier, Piotr Faliszewski, Nimrod Talmon, Robert Bredereck

Publication date: 19 April 2016

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4927

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) Approximation algorithms (68W25)

Related Items

The complexity of online bribery in sequential elections ⋮ Resolute control: forbidding candidates from winning an election is hard ⋮ The complexity of priced control in elections ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ The control complexity of \(r\)-Approval: from the single-peaked case to the general case ⋮ Local distance constrained bribery in voting ⋮ On the Computational Complexity of Variants of Combinatorial Voter Control in Elections ⋮ Approximation and hardness of shift-Bribery ⋮ Computational complexity characterization of protecting elections from bribery ⋮ Protecting elections by recounting ballots ⋮ Complexity of shift bribery for iterative voting rules ⋮ Combinatorial voter control in elections ⋮ Exploiting social influence to control elections based on positional scoring rules