Parameterized Complexity of Control and Bribery for d-Approval Elections

DOI10.1007/978-3-319-03780-6_23zbMath1408.91068OpenAlexW2397607982MaRDI QIDQ2867125

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

Publication date: 10 December 2013

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03780-6_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Voting theory (91B12)

Cites Work

• 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