Large-scale election campaigns: combinatorial shift bribery
DOI10.1613/JAIR.4927zbMATH Open1352.68094OpenAlexW2299059564MaRDI QIDQ2800947FDOQ2800947
Authors: Robert Bredereck, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon 
Publication date: 19 April 2016
Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4927
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Voting theory (91B12)
Cited In (15)
- Exploiting social influence to control elections based on positional scoring rules
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case
- Computational complexity characterization of protecting elections from bribery
- Complexity of shift bribery in committee elections
- The complexity of online bribery in sequential elections
- Approximation and hardness of shift-bribery
- Resolute control: forbidding candidates from winning an election is hard
- On the computational complexity of variants of combinatorial voter control in elections
- Complexity of shift bribery for iterative voting rules
- The complexity of priced control in elections
- Prices matter for the parameterized complexity of shift bribery
- Local distance constrained bribery in voting
- Protecting elections by recounting ballots
- How hard is bribery in elections?
- Combinatorial voter control in elections
This page was built for publication: Large-scale election campaigns: combinatorial shift bribery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800947)
