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

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

Feng Shi, Min Yang, Weimin Su, Jianxin Wang, Jiong Guo, Qilong Feng, 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 choiceparameterized complexityproblem kernelsstrategic behaviors of voting protocols

Mathematics Subject Classification ID

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

Related Items (4)

Heuristics for opinion diffusion via local elections ⋮ Partition on trees with supply and demand: kernelization and algorithms ⋮ Improved kernel results for some FPT problems based on simple observations ⋮ A parameterized perspective on protecting elections

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anyone but him: the complexity of precluding an alternative
• Voting schemes for which it can be difficult to tell who won the election
• How hard is it to control an election?
• Handbook of social choice and welfare. Vol. 1.
• Studies in Computational Aspects of Voting
• Integer Programming with a Fixed Number of Variables
• When are elections with few candidates hard to manipulate?
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• How Hard Is Bribery in Elections?
• Kernelization: New Upper and Lower Bound Techniques
• An efficient parameterized algorithm for m-set packing

This page was built for publication: Parameterized complexity of control and bribery for \(d\)-approval elections