Efficient Election Campaign Optimization Using Integer Programming

Abstract

Purpose: Political parties spend significant amounts of resources during their election campaigns, which are usually designed in a sub-optimal and informal way. This study aims to provide a mathematical framework for political parties to optimize their election campaigns, so that they can maximize their performance in the elections. Design/methodology/approach: In this work, we provide certain mathematical relations to determine the minimum necessary number of votes to gain additional seats in an election region under the D'hondt election rule. Also we develop a convenient mathematical model that optimizes the resource allocation scheme of a political party to maximize the potential seats won. We test our models on Turkish Parliamentary elections data Findings: Our results show that with various basic assumptions, which are suitable for real life cases, one can obtain significant gains in the election outcomes even with small budgets. We also provide the relations among swing vote rates, unit vote costs and budget with the number seats won in a parliament. Originality/value: This study provides useful insights for both political party management teams as well as researchers. Political parties need to conduct more market research to collect and work on election data to increase their performances. From the research perspective, to the best of our knowledge, this is one of first studies that approaches to the election campaigns for the D'hondt system with mathematical optimization tools.