Parameterized complexity of control and bribery for \(d\)-approval elections

DOI10.1016/j.tcs.2015.06.016zbMath1328.68097MaRDI QIDQ2354767

Jiong Guo, Min Yang, Qilong Feng, Jianxin Wang, Feng Shi, Weimin Su, Jian'er Chen

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.016

zbMATH Keywords

computational social choice; parameterized complexity; problem kernels; strategic behaviors of voting protocols

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91B12: Voting theory

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

91B14: Social choice