Multivariate Complexity Analysis of Swap Bribery

DOI10.1007/978-3-642-17493-3_12zbMath1310.91061arXiv1011.1338OpenAlexW3026634264MaRDI QIDQ3058696

Britta Dorn, Ildikó Schlotter

Publication date: 7 December 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1011.1338

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 (1)

Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

Cites Work

• Unnamed Item
• Dichotomy for voting systems
• On the parameterized complexity of multiple-interval graph problems
• Parameterized computational complexity of control problems in voting systems
• Parameterized complexity of candidate control in elections and related digraph problems
• Towards a dichotomy for the possible winner problem in elections based on scoring rules
• On complexity of lobbying in multiple referenda
• Integer Programming with a Fixed Number of Variables
• Reflections on Multivariate Algorithmics and Problem Parameterization
• When are elections with few candidates hard to manipulate?
• On Problem Kernels for Possible Winner Determination under the k-Approval Protocol
• Swap Bribery
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• How Hard Is Bribery in Elections?

This page was built for publication: Multivariate Complexity Analysis of Swap Bribery