Large-scale election campaigns: combinatorial shift bribery

DOI10.1613/JAIR.4927MaRDI QIDQ2800947zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Voting theory (91B12)

Recommendations

• Approximation and hardness of shift-bribery
• How hard is bribery in elections?
• Complexity of shift bribery in committee elections
• Prices matter for the parameterized complexity of shift bribery
• Frugal bribery in voting

Cited in

(16)

• Protecting elections by recounting ballots
• Complexity of shift bribery for iterative voting rules
• Exploiting social influence to control elections based on positional scoring rules
• The complexity of online bribery in sequential elections
• Resolute control: forbidding candidates from winning an election is hard
• Local distance constrained bribery in voting
• Approximation and hardness of shift-bribery
• Combinatorial voter control in elections
• The control complexity of \(r\)-Approval: from the single-peaked case to the general case
• On the computational complexity of variants of combinatorial voter control in elections
• The complexity of priced control in elections
• Prices matter for the parameterized complexity of shift bribery
• How hard is bribery in elections?
• Complexity of shift bribery in committee elections
• Computational complexity characterization of protecting elections from bribery
• Parameterized analysis of bribery in \textit{Challenge the champ} tournaments

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)