Solving Hard Control Problems in Voting Systems via Integer Programming
Lists
Only you see this
Abstract
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.
BibTeX
@article{polyakovskiy2016solving,
author = {Sergey Polyakovskiy and Rudolf Berghammer and Frank Neumann},
title = {{Solving Hard Control Problems in Voting Systems via Integer Programming}},
journal = {Eur. J. Oper. Res.},
year = {2016},
url = {https://openreview.net/forum?id=GcyOtUGwHRM},
}