Game Theory in Voting Systems and Elections

This article explores how game theory is applied to political elections and voting systems. By analyzing strategic voting, candidate positioning, and coalition formation, we examine how mathematical models predict political behavior, explain voter choices, and shape democratic outcomes.

Strategic Voting and the Gibbard-Satterthwaite Theorem

In an ideal democratic system, voters would simply cast ballots for their preferred candidates. However, game theory reveals that voters often act strategically rather than sincerely. Strategic voting—or tactical voting—occurs when a voter supports a candidate who is not their first choice to prevent an even worse outcome.

According to the Gibbard-Satterthwaite theorem, any voting system with three or more options is susceptible to strategic voting, unless it is a dictatorship or relies on chance. In first-past-the-post (plurality) systems, this dynamic often leads to Duverger’s Law, which states that plurality rule elections tend to favor a two-party system. Voters realize that voting for a third-party candidate may “waste” their vote and inadvertently help their least preferred major candidate win. Consequently, they strategically align with one of the two viable frontrunners.

The Median Voter Theorem and Candidate Positioning

Game theory also models how political candidates choose their platforms. Developed by Duncan Black and popularized by Anthony Downs, the Median Voter Theorem assumes a one-dimensional political spectrum (left to right) where voters choose the candidate closest to their own ideology.

In a two-candidate election under majority rule, both candidates have a strong incentive to target the median voter—the individual at the exact middle of the political spectrum. If Candidate A moves too far to the left, Candidate B can move slightly to the left of the center and capture the majority of votes. As a result, both candidates are driven toward the center to maximize their chances of winning. This Nash equilibrium explains why candidates in two-party systems often propose highly similar, moderate policies during general elections.

Agenda Control and Arrow’s Impossibility Theorem

The order in which votes are cast and how alternatives are presented can drastically alter the outcome of an election. This is known as agenda control. Game theorists study how political actors manipulate the voting agenda to achieve their desired results.

This manipulation is closely tied to Arrow’s Impossibility Theorem. Kenneth Arrow demonstrated that no rank-order voting system can convert individual preferences into a community-wide ranking without violating at least one of several reasonable criteria, such as non-dictatorship or the independence of irrelevant alternatives. Because no perfect voting system exists, whoever controls the voting procedure or the order of elimination has significant power to influence the final winner.

Coalition Government Formation

In parliamentary democracies with proportional representation, single-party majorities are rare. Political parties must form coalitions to govern, a process modeled using cooperative game theory.

Parties act as players seeking to maximize their payoff, which includes cabinet portfolios and policy implementation. Theorists use models like the “minimal winning coalition” to predict which partnerships will form. According to this theory, parties will form coalitions that contain only enough partners to secure a legislative majority, thereby avoiding the dilution of power and resources among unnecessary partners.