How Hard Is Bribery with Distance Restrictions

DOI10.3233/978-1-61499-672-9-363zbMath1396.91155OpenAlexW2572410607MaRDI QIDQ4576183

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

zbMATH Keywords

complexitybriberyelectiondistance restrictions

Mathematics Subject Classification ID

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

Related Items (2)

How hard is safe bribery? ⋮ On the complexity of bribery with distance restrictions

This page was built for publication: How Hard Is Bribery with Distance Restrictions