Solving hard control problems in voting systems via integer programming

•We address various voting systems and types of control of elections.•We show how hard control problems can be modeled as integer programs.•We demonstrate that this allows to treat also larger elections successfully.•We give a technique that adopts solutions of constructive control to destructive on...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2016-04, Vol.250 (1), p.204-213
Main Authors: Polyakovskiy, S., Berghammer, R., Neumann, F.
Format: Article
Language:English
Subjects:
Control problem
Election model
Elections
Electoral reform
Integer programming
Linear programming
Mathematical problems
Studies
Voting
Voting machines
Voting system
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We address various voting systems and types of control of elections.•We show how hard control problems can be modeled as integer programs.•We demonstrate that this allows to treat also larger elections successfully.•We give a technique that adopts solutions of constructive control to destructive one. Voting problems are central in the area of social choice. In this article, we investigate various voting systems and types of control of elections. We present integer linear programming (ILP) formulations for a wide range of NP-hard control problems. Our ILP formulations are flexible in the sense that they can work with an arbitrary number of candidates and voters. Using the off-the-shelf solver Cplex, we show that our approaches can manipulate elections with a large number of voters and candidates efficiently.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2015.08.052