Maximizing political vote in multiple districts

Abstract

This paper models a resource allocation problem in the political context. Voters and political candidates of two parties are positioned in each of n given electoral districts. We assume that each voter will vote for the candidate he is more attracted to. This attraction is modeled by an attraction function. Each of the parties now attempts to allocate a finite budget to maximize their objective, which is either the popular vote or the number of districts, in which the party has a majority. Individual scenarios are examined with respect to leader-follower solutions and Nash equilibria. The paper then describes a dynamic model that successively allocates existing funds plus additional donations to candidates in different electoral districts.