A Mixed Integer Linear Program for Election Campaign Optimization Under D’Hondt Rule

Evren Güney ()
Additional contact information
Evren Güney: Istanbul Arel University

A chapter in Operations Research Proceedings 2017, 2018, pp 73-79 from Springer

Abstract: Abstract Election campaign optimization problem (ECOP) can be described as finding the best way to allocate a political party’s resources among different election locations in order to maximize the seats or member of parliaments (MPs) won. For this purpose, first one has to determine the minimum amount of votes needed to pass the opponent to win extra seats. The analysis are carried out on one of the most popular election rules: D’Hondt rule and mathematical formulae are derived to exactly determine the required vote amounts. Next, a mixed integer linear program to capture the problem is proposed. Finally, the methodology is tested on the Turkish Parliamentary elections data and it is observed that with small amount of budget shifts among election regions significant gains can be obtained.

Keywords: Election campaign optimization; Mixed integer linear programming; D’Hondt election rule (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_11

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_11

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().