Binary linear programming solutions and non-approximability for control problems in voting systems
From MaRDI portal
Recommendations
- Solving hard control problems in voting systems via integer programming
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- Copeland Voting Fully Resists Constructive Control
- Parameterized computational complexity of control problems in voting systems
- On the computational complexity of variants of combinatorial voter control in elections
Cites work
- scientific article; zbMATH DE number 5764882 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- 50 Years of Integer Programming 1958-2008
- Anyone but him: the complexity of precluding an alternative
- Computational Aspects of Approval Voting
- Digraphs
- How hard is bribery in elections?
- How hard is it to control an election?
- Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
- Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
- On making a distinguished vertex minimum degree by vertex deletion
- Parameterized complexity of candidate control in elections and related digraph problems
- Parametrized complexity theory.
- The computational difficulty of manipulating an election
- Voter Antagonism and the Paradox of Voting
- When are elections with few candidates hard to manipulate?
Cited in
(3)
This page was built for publication: Binary linear programming solutions and non-approximability for control problems in voting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741772)
