Pure vs. Mixed Strategies in Mathematical Game Theory

In mathematical game theory, players make decisions using either pure or mixed strategies to maximize their outcomes. This article provides a direct comparison between these two approaches, explaining how pure strategies rely on deterministic, fixed choices while mixed strategies incorporate probability and randomness to outmaneuver opponents. By examining the mathematical definitions, payoff calculations, and strategic applications of each, we will clarify how these concepts function and why they are essential for finding equilibrium in competitive scenarios.

What is a Pure Strategy?

A pure strategy defines a specific, deterministic action that a player will take for every possible situation they might face in a game. There is no randomness involved. If a player repeats the game under the exact same conditions, a pure strategy dictates that they will make the exact same choice every time.

From a mathematical perspective:

  • Certainty: The player selects a single action with a probability of \(1\) (or \(100\%\)), while all other available actions are assigned a probability of \(0\).
  • Payoffs: Because the action is fixed, calculating the payoff is straightforward. You simply look at the intersection of the players' chosen actions in a payoff matrix to see the exact result.
  • Example: In the classic Prisoner’s Dilemma, deciding to "Always Defect" regardless of what the other player does is a pure strategy.

What is a Mixed Strategy?

A mixed strategy occurs when a player does not commit to a single action, but instead assigns a probability distribution over two or more pure strategies. Before the game is played, the player uses a randomizing device (conceptually, like rolling a die or flipping a coin) to decide which pure strategy to execute based on those assigned probabilities.

From a mathematical perspective:

  • Probability Distribution: If a player has \(n\) available actions, a mixed strategy is represented as a vector of probabilities \((p_1, p_2, ..., p_n)\), where each probability is between \(0\) and \(1\), and the sum of all probabilities equals \(1\).
  • Expected Payoffs: Because the outcome is no longer certain, payoffs cannot be read directly from a single cell in a matrix. Instead, mathematicians calculate the expected payoff. This is the weighted average of all possible outcomes, determined by multiplying the payoff of each outcome by the probability of it occurring.
  • Example: In Rock-Paper-Scissors, playing Rock, Paper, and Scissors each with a \(\frac{1}{3}\) (\(33.3\%\)) probability is a mixed strategy.

Key Mathematical Distinctions

When analyzing games mathematically, three primary factors distinguish pure strategies from mixed strategies:

1. Discrete vs. Continuous Choice Spaces

A player using a pure strategy has a finite, discrete number of choices. If you have two actions, Up and Down, you only have two pure strategies. However, a player using a mixed strategy has an infinite, continuous number of choices. They can choose Up with \(50\%\) probability, \(50.1\%\) probability, \(50.001\%\) probability, and so on.

2. The Concept of Degeneracy

Mathematically, a pure strategy is actually just a special case of a mixed strategy—often called a "degenerate" mixed strategy. If a game offers two choices, Action A and Action B, the mixed strategy is written as \((p, 1-p)\), where \(p\) is the probability of choosing Action A. If a player sets \(p = 1\), they are playing a pure strategy for Action A. Therefore, the set of all pure strategies is a subset of all mixed strategies.

3. Existence of Nash Equilibrium

A Nash Equilibrium is a state where no player can benefit by changing their strategy while the other players keep theirs unchanged. Many games do not have a Nash Equilibrium if players are restricted to pure strategies. However, mathematician John Nash proved that every finite game has at least one Nash Equilibrium if you allow for mixed strategies.

Why Players Use Mixed Strategies

The transition from pure to mixed strategies is driven by the mathematical need for unpredictability, particularly in zero-sum games (where one player's gain is another's loss).

If you play a pure strategy in a game like Matching Pennies or when taking a penalty kick in soccer, your opponent will eventually figure out your pattern and exploit it to reduce your payoff to the minimum. By introducing a mixed probabilistic strategy, you make your exact action unreadable.

Mathematically, an optimal mixed strategy is designed to make your opponent indifferent among their own choices. In Rock-Paper-Scissors, if you play each option \(\frac{1}{3}\) of the time, your opponent's expected payoff is \(0\) regardless of whether they choose Rock, Paper, or Scissors. By randomizing your behavior with precise probabilities, you neutralize your opponent's ability to exploit your decisions.