Solving hard control problems in voting systems via integer programming

Sergey Polyakovskiy

doi:10.1016/j.ejor.2015.08.052

Return

Solving hard control problems in voting systems via integer programming

2016-04-01

Sergey Polyakovskiy *

Rudolf Berghammer

Frank Neumann

DOI：10.1016/j.ejor.2015.08.052

Original

Save

View PDF

Abstract

En 中文

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. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.

Keywords:

Voting system

Election model

Control problem

Integer programming

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.