Binary linear programming solutions and non-approximability for control problems in voting systems
From MaRDI portal
Publication:741772
DOI10.1016/j.dam.2013.08.032zbMath1303.91072OpenAlexW2140647829MaRDI QIDQ741772
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.032
approximationvotinggraph algorithmscontrol problemscomputational social choicebinary linear programming formulationsdigraph modification problems
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Anyone but him: the complexity of precluding an alternative
- Parameterized complexity of candidate control in elections and related digraph problems
- How hard is it to control an election?
- The computational difficulty of manipulating an election
- Parametrized complexity theory.
- Computational Aspects of Approval Voting
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- When are elections with few candidates hard to manipulate?
- 50 Years of Integer Programming 1958-2008
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- How Hard Is Bribery in Elections?
- Voter Antagonism and the Paradox of Voting
- Digraphs
This page was built for publication: Binary linear programming solutions and non-approximability for control problems in voting systems