STRATEGYMonths to result

Minimax Theorem

Minimizing the maximum loss

Problem it solves

unclear strategic direction

Best for

High-stakes, competitive situations

Not ideal for

Cooperative or low-stakes situations

Overview

Why this framework exists

The minimax theorem states that in zero-sum games, one player should attempt to minimize their opponent's maximum payoff while their opponent attempts to maximize their own minimum payoff. This leads to a Nash equilibrium in mixed strategies, where both players use a mixture of pure strategies to achieve the best possible outcome.

Core principles

3 total
  1. In zero-sum games, one player's gain is the other's loss.
  2. Players should attempt to minimize their opponent's maximum payoff.
  3. The minimum of the maximum payoffs equals the maximum of the minimum payoffs.

Steps

4 steps
  1. Identify the game as a zero-sum game
    Determine if the game is a zero-sum game, where one player's gain is the other's loss.
    Pro tipConsider the payoffs and outcomes of the game to determine if it is zero-sum.
    WarningNot all games are zero-sum, so be careful in applying the minimax theorem.
  2. Determine the pure strategies available to each player
    Identify the pure strategies available to each player in the game.
    Pro tipConsider the possible actions and outcomes for each player.
    WarningBe sure to include all possible pure strategies.
  3. Calculate the payoffs for each pure strategy combination
    Calculate the payoffs for each combination of pure strategies.
    Pro tipUse the payoffs to determine the best mixture of pure strategies.
    WarningBe careful in calculating the payoffs, as small errors can lead to incorrect conclusions.
  4. Find the Nash equilibrium in mixed strategies
    Use the payoffs to find the Nash equilibrium in mixed strategies, where both players use a mixture of pure strategies to achieve the best possible outcome.
    Pro tipConsider the minimax theorem and the principles of game theory to find the Nash equilibrium.
    WarningThe Nash equilibrium may not always be unique or easy to find.

Checklist

Saved in your browser

Examples

2 cases
Soccer penalty kicks

In soccer penalty kicks, the kicker and goalie engage in a zero-sum game, where the kicker tries to score and the goalie tries to prevent the score.

OutcomeThe minimax theorem can be used to determine the best mixture of pure strategies for the kicker and goalie, leading to a Nash equilibrium in mixed strategies.
Rock-Paper-Scissors

In Rock-Paper-Scissors, two players engage in a zero-sum game, where each player tries to win by choosing the correct move.

OutcomeThe minimax theorem can be used to determine the best mixture of pure strategies for each player, leading to a Nash equilibrium in mixed strategies.

Common mistakes

3 traps
Not considering the game as a zero-sum game
Failing to recognize the game as a zero-sum game can lead to incorrect application of the minimax theorem.
Not including all possible pure strategies
Failing to include all possible pure strategies can lead to incorrect conclusions about the best mixture of pure strategies.
Miscalculating the payoffs
Small errors in calculating the payoffs can lead to incorrect conclusions about the best mixture of pure strategies.

Origin story

How this framework came to be

The minimax theorem was first proposed by John von Neumann and later elaborated by him and Oscar Morgenstern in their book 'Theory of Games and Economic Behavior'.

Source

Traced to primary
Source · BOOK
The Art of Strategy: A Game Theorist's Guide to Success in Business and Life
Dixit, Avinash K. · 2008
Open source →

Related frameworks

Browse all Strategy →