Binary linear programming solutions and non-approximability for control problems in voting systems

DOI10.1016/J.DAM.2013.08.032zbMATH Open1303.91072OpenAlexW2140647829MaRDI QIDQ741772FDOQ741772

Authors: Frank Gurski, Magnus Roos 

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

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

zbMATH Keywords

approximationgraph algorithmsvotingcontrol problemscomputational social choicebinary linear programming formulationsdigraph modification problems

Mathematics Subject Classification ID

Social choice (91B14) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Title not available (Why is that?)
• Parametrized complexity theory.
• Computational Aspects of Approval Voting
• 50 Years of Integer Programming 1958-2008
• Digraphs
• Title not available (Why is that?)
• Voter Antagonism and the Paradox of Voting
• When are elections with few candidates hard to manipulate?
• Anyone but him: the complexity of precluding an alternative
• How hard is it to control an election?
• The computational difficulty of manipulating an election
• Llull and Copeland Voting Computationally Resist Bribery and Constructive Control
• How hard is bribery in elections?
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
• Parameterized complexity of candidate control in elections and related digraph problems
• On making a distinguished vertex minimum degree by vertex deletion

Cited In (3)

• Copeland Voting Fully Resists Constructive Control
• Solving hard control problems in voting systems via integer programming
• Title not available (Why is that?)

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)