The complexity of online bribery in sequential elections
From MaRDI portal
Publication:2121471
DOI10.1016/j.jcss.2022.01.006zbMath1483.68144arXiv1906.08308MaRDI QIDQ2121471
Hemaspaandra, Lane A., Jörg Rothe, Edith Hemaspaandra
Publication date: 4 April 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08308
computational complexity; logic; computational social choice; bribery; quantifier assignment; sequential elections
68Q25: Analysis of algorithms and problem complexity
91B12: Voting theory
03B70: Logic in computer science
91F10: History, political science
91B14: Social choice