How hard is bribery with distance restrictions?

DOI10.3233/978-1-61499-672-9-363zbMATH Open1396.91155OpenAlexW2572410607MaRDI QIDQ4576183FDOQ4576183

Authors: Yongjie Yang, Yash Raj Shrestha, Jiong Guo 

Publication date: 12 July 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/ecai/ecai2016.html#YangSG16

Recommendations

• On the complexity of bribery with distance restrictions
• Local distance constrained bribery in voting
• How hard is bribery in elections?
• Approximation and hardness of shift-bribery
• Frugal bribery in voting

zbMATH Keywords

complexitybriberyelectiondistance restrictions

Mathematics Subject Classification ID

Social choice (91B14) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (6)

• Computational complexity characterization of protecting elections from bribery
• On the complexity of bribery with distance restrictions
• How hard is safe bribery?
• Local distance constrained bribery in voting
• Distance restricted manipulation in voting
• How hard is bribery in elections?

This page was built for publication: How hard is bribery with distance restrictions?

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