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!
cited_by cdi_FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113
cites cdi_FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113
container_end_page 213
container_issue 1
container_start_page 204
container_title European journal of operational research
container_volume 250
creator Polyakovskiy, S.
Berghammer, R.
Neumann, F.
description •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.
doi_str_mv 10.1016/j.ejor.2015.08.052
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1761126263</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221715008085</els_id><sourcerecordid>3936594741</sourcerecordid><originalsourceid>FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AU8Fz62TjyZd8CKLrsKCB_Uc0nR2TWmbNekW_PemrGdPA-_HzPAQckuhoEDlfVtg60PBgJYFVAWU7IwsaKVYLisJ52QBXKmcMaouyVWMLUBK0nJBNu--m9ywz75MaDLrhzH4LjsEX3fYx8wN2eTH2Y8_cZyVyZmkjrjHMMf2wfR98q_Jxc50EW_-5pJ8Pj99rF_y7dvmdf24za0APua1taKUSjBZVgxRlAZqw2Wpaq4sRSFWlDIG3HC7E1bJGpTAlUEqqoo1lPIluTvtTbe_jxhH3fpjGNJJTZVMZckkTyl2StngYwy404fgehN-NAU9A9OtnoHpGZiGSidgqfRwKmH6f3IYdLQOB4uNC2hH3Xj3X_0XKrdzsw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1761126263</pqid></control><display><type>article</type><title>Solving hard control problems in voting systems via integer programming</title><source>ScienceDirect Freedom Collection</source><creator>Polyakovskiy, S. ; Berghammer, R. ; Neumann, F.</creator><creatorcontrib>Polyakovskiy, S. ; Berghammer, R. ; Neumann, F.</creatorcontrib><description>•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.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2015.08.052</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Control problem ; Election model ; Elections ; Electoral reform ; Integer programming ; Linear programming ; Mathematical problems ; Studies ; Voting ; Voting machines ; Voting system</subject><ispartof>European journal of operational research, 2016-04, Vol.250 (1), p.204-213</ispartof><rights>2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS)</rights><rights>Copyright Elsevier Sequoia S.A. Apr 1, 2016</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113</citedby><cites>FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Polyakovskiy, S.</creatorcontrib><creatorcontrib>Berghammer, R.</creatorcontrib><creatorcontrib>Neumann, F.</creatorcontrib><title>Solving hard control problems in voting systems via integer programming</title><title>European journal of operational research</title><description>•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.</description><subject>Control problem</subject><subject>Election model</subject><subject>Elections</subject><subject>Electoral reform</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Mathematical problems</subject><subject>Studies</subject><subject>Voting</subject><subject>Voting machines</subject><subject>Voting system</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AU8Fz62TjyZd8CKLrsKCB_Uc0nR2TWmbNekW_PemrGdPA-_HzPAQckuhoEDlfVtg60PBgJYFVAWU7IwsaKVYLisJ52QBXKmcMaouyVWMLUBK0nJBNu--m9ywz75MaDLrhzH4LjsEX3fYx8wN2eTH2Y8_cZyVyZmkjrjHMMf2wfR98q_Jxc50EW_-5pJ8Pj99rF_y7dvmdf24za0APua1taKUSjBZVgxRlAZqw2Wpaq4sRSFWlDIG3HC7E1bJGpTAlUEqqoo1lPIluTvtTbe_jxhH3fpjGNJJTZVMZckkTyl2StngYwy404fgehN-NAU9A9OtnoHpGZiGSidgqfRwKmH6f3IYdLQOB4uNC2hH3Xj3X_0XKrdzsw</recordid><startdate>20160401</startdate><enddate>20160401</enddate><creator>Polyakovskiy, S.</creator><creator>Berghammer, R.</creator><creator>Neumann, F.</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160401</creationdate><title>Solving hard control problems in voting systems via integer programming</title><author>Polyakovskiy, S. ; Berghammer, R. ; Neumann, F.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Control problem</topic><topic>Election model</topic><topic>Elections</topic><topic>Electoral reform</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Mathematical problems</topic><topic>Studies</topic><topic>Voting</topic><topic>Voting machines</topic><topic>Voting system</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Polyakovskiy, S.</creatorcontrib><creatorcontrib>Berghammer, R.</creatorcontrib><creatorcontrib>Neumann, F.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Polyakovskiy, S.</au><au>Berghammer, R.</au><au>Neumann, F.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Solving hard control problems in voting systems via integer programming</atitle><jtitle>European journal of operational research</jtitle><date>2016-04-01</date><risdate>2016</risdate><volume>250</volume><issue>1</issue><spage>204</spage><epage>213</epage><pages>204-213</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>•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.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2015.08.052</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 2016-04, Vol.250 (1), p.204-213
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_1761126263
source ScienceDirect Freedom Collection
subjects Control problem
Election model
Elections
Electoral reform
Integer programming
Linear programming
Mathematical problems
Studies
Voting
Voting machines
Voting system
title Solving hard control problems in voting systems via integer programming
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T23%3A20%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Solving%20hard%20control%20problems%20in%20voting%20systems%20via%20integer%20programming&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Polyakovskiy,%20S.&rft.date=2016-04-01&rft.volume=250&rft.issue=1&rft.spage=204&rft.epage=213&rft.pages=204-213&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2015.08.052&rft_dat=%3Cproquest_cross%3E3936594741%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c403t-bcc4567426582ee45a0ba3657b37c1e449112203a3cf4c76b074e9ae14882d113%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1761126263&rft_id=info:pmid/&rfr_iscdi=true