Solving hard control problems in voting systems via integer programming

DOI10.1016/j.ejor.2015.08.052zbMath1346.91075arXiv1408.5987OpenAlexW1915090682MaRDI QIDQ322433

Frank Neumann, Rudolf Berghammer, Sergey Polyakovskiy

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingcontrol problemelection modelvoting system

Mathematics Subject Classification ID

Integer programming (90C10) Voting theory (91B12) Social choice (91B14)

Related Items (1)

Supermajority politics: equilibrium range, policy diversity, utilitarian welfare, and political compromise

Uses Software

• RelView
• CPLEX
• PrefLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Schulze and ranked-pairs voting are fixed-parameter tractable to bribe, manipulate, and control
• Is computational complexity a barrier to manipulation?
• Binary linear programming solutions and non-approximability for control problems in voting systems
• Anyone but him: the complexity of precluding an alternative
• How hard is it to control an election?
• Relation Algebra, RelView, and Plurality Voting
• Multimode Control Attacks on Elections
• When are elections with few candidates hard to manipulate?
• Reducibility among Combinatorial Problems
• Relation Algebra and RelView Applied to Approval Voting
• A Short Introduction to Computational Social Choice

This page was built for publication: Solving hard control problems in voting systems via integer programming