Computational complexity characterization of protecting elections from bribery

DOI10.1007/978-3-030-58150-3_7MaRDI QIDQ5918250zbMATH OpenOpenAlexFDO

Authors Lin Chen, Ahmed Sunny, Shouhuai Xu, Yang Lu, Weidong (Larry) Shi, Nolan Shah, Zhi Min Gao, Lei Xu

Publication date 21 April 2021

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2007.02533

zbMATH Keywords

\(\varSigma_2^p\)-hardnesscomplexityNP-hardnessvoting

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Computational complexity characterization of protecting elections from bribery
• How hard is bribery in elections?
• Control and bribery in voting
• A Parameterized Perspective on Attacking and Defending Elections
• How hard is bribery with distance restrictions?

Cited in

(8)

• Multivariate complexity analysis of Swap Bribery
• The computational difficulty of manipulating an election
• The complexity of online bribery in sequential elections
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• scientific article; zbMATH DE number 1024093 (Why is no real title available?)
• scientific article; zbMATH DE number 7450032 (Why is no real title available?)
• A Parameterized Perspective on Attacking and Defending Elections
• Hardness and algorithms for electoral manipulation under media influence

This page was built for publication: Computational complexity characterization of protecting elections from bribery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918250)