Blotto games (or Colonel Blotto games) constitute a class of two-person zero-sum games in which the players are tasked to simultaneously distribute limited resources over several objects, with the gain (or payoff) being equal to the sum of the gains on the individual objects. Zero-sum describes a situation in which a participants gain (or loss) is exactly balanced by the losses (or gains) of the other participant(s). ...

The game is named after the fictional colonel Blotto who was supposed to be tasked to find the optimum distribution of his soldiers over N battlefields knowing that: 1) within each battlefield the party that has allocated most soldiers will win, but 2) both parties do not know how many soldiers the opposing party will allocate to each battlefield, and: 3) the side that wins the majority of the N battles is overall winner.

Example

As an example Blotto game, consider the game in which two players each write down three positive integers in non-decreasing order and such that they add up to a pre-specified number S. Subsequently, the two players show each other their writings, and compare corresponding numbers. The player who has two numbers higher than the corresponding ones of the opponent wins the game.

For S = 6 only three choices of numbers are possible: (2, 2, 2), (1, 2, 3) and (1, 1, 4). It is easy to see that:

(1, 1, 4) against (1, 2, 3) is a draw

(1, 2, 3) against (2, 2, 2) is a draw

(2, 2, 2) beats (1, 1, 4)

It follows that the optimum strategy (Nash equilibrium) is (2, 2, 2) as it does not do worse than breaking even against any other strategy whilst beating one other strategy. In game theory, the Nash equilibrium (named after John Forbes Nash, who proposed it) is a kind of solution concept of a game involving two or more players, where no player has anything to gain by changing only his or her own strategy unilaterally. ...

For larger S the game becomes progressively more difficult to analyse. For S = 12, it can be shown that (2, 4, 6) represents the optimal strategy, whilst for S > 12, deterministic strategies fail to be optimal. For S = 13, choosing (3, 5, 5), (3, 3, 7) and (1, 5, 7) with probability 1/3 each can be shown to be the optimal probabilistic strategy.

Real life example

In a recent paper^[1], the 2000 Presidential Elections, one of the closest races in recent history, have been modelled as a colonel Blotto game. It is argued that Gore could have utilized a strategy that would have won the election, but that such a strategy was not identifiable ex ante. The United States presidential election of 2000 was a contest between the Democratic candidate Al Gore versus the Republican candidate of George W. Bush. ... Ex ante is a Latin term meaning beforehand. Ex ante evaluations deal with forecasting and forecasted returns on invested money. ...

External links

• Jonathan Partington's Colonel Blotto page

Jonathan R. Partington (born February 4, 1955 in Norwich, United Kingdom) is currently a professor of pure mathematics at the University of Leeds. ...

References

1. ^ [http://www.socsci.duke.edu/ssri/federalism/papers/tofiasmunger.pdf Lotto, Blotto, or Frontrunner: An Analysis of Spending Patterns by the National Party Committees in the 2000 Presidential Election ]