Mathwords logoMathwords

Mixed Strategy — Definition, Formula & Example

A mixed strategy is a plan in which a player randomizes, choosing each available action with a set probability instead of always picking the same one. Bluffing in poker and varying penalty-kick directions are mixed strategies.

For a player with a finite set of pure strategies S={s1,…,sn}S = \{s_1, \dots, s_n\}, a mixed strategy is a probability distribution σ\sigma on SS: a vector (p1,…,pn)(p_1, \dots, p_n) with pi≥0p_i \ge 0 and ∑i=1npi=1\sum_{i=1}^{n} p_i = 1. A pure strategy is the special case where one pi=1p_i = 1. By Nash's theorem (1950), every finite game has at least one Nash equilibrium in mixed strategies.

Key Formula

E(p,q)=∑i=1m∑j=1npi qj aijE(p, q) = \sum_{i=1}^{m} \sum_{j=1}^{n} p_i \, q_j \, a_{ij}
Where:
  • E(p,q)E(p, q) = Row player's expected payoff when both players use mixed strategies
  • pip_i = Probability the row player chooses row ii
  • qjq_j = Probability the column player chooses column jj
  • aija_{ij} = Row player's payoff when row ii meets column jj

Worked Example

Problem: In a zero-sum game, Row picks Up or Down and Column picks Left or Right. Row's winnings, which Column pays, are: Up/Left $3, Up/Right −$1, Down/Left −$2, Down/Right $4. No cell is a saddle point, because Row's maximin of −$1 differs from Column's minimax of $3. Find the equilibrium mixed strategies and the value of the game.
Step 1: Let Row play Up with probability pp. Row picks pp so that Column gets the same expected result from Left and from Right. Then Column cannot exploit Row.
3p−2(1−p)=−p+4(1−p)  ⇒  5p−2=4−5p  ⇒  p=353p - 2(1-p) = -p + 4(1-p) \;\Rightarrow\; 5p - 2 = 4 - 5p \;\Rightarrow\; p = \tfrac{3}{5}
Step 2: Let Column play Left with probability qq. Column picks qq so that Row's expected payoff is the same for Up and Down.
3q−(1−q)=−2q+4(1−q)  ⇒  4q−1=4−6q  ⇒  q=123q - (1-q) = -2q + 4(1-q) \;\Rightarrow\; 4q - 1 = 4 - 6q \;\Rightarrow\; q = \tfrac{1}{2}
Step 3: Substitute p=35p = \tfrac{3}{5} into Row's expected payoff against Left. Any column gives the same result.
3(35)−2(25)=95−45=13\left(\tfrac{3}{5}\right) - 2\left(\tfrac{2}{5}\right) = \tfrac{9}{5} - \tfrac{4}{5} = 1
Answer: Row plays Up with probability 35\tfrac{3}{5} and Down with probability 25\tfrac{2}{5}. Column plays Left and Right with probability 12\tfrac{1}{2} each. The game's value is $1 per round in Row's favor.

Why It Matters

Mixed strategies are how you solve games like rock-paper-scissors or matching pennies, which have no pure-strategy equilibrium. In operations research and game theory courses, two-player zero-sum games are often solved by finding optimal mixed strategies with linear programming. The same idea shapes randomized audit schedules and security patrol routes.

Common Mistakes

Mistake: Choosing your own probabilities so that your own two options pay the same.
Correction: In equilibrium, your probabilities make your opponent indifferent. That is why Row's pp comes from Column's payoffs in Step 1, and Column's qq comes from Row's payoffs in Step 2.

Related Terms

  • Game Theory — Parent field that defines strategies, payoffs, and equilibria
  • Prisoner's Dilemma — Game solved by a pure dominant strategy, no mixing
  • Fair Game — A game whose expected net gain is zero for every player
  • Optimization — Linear programming computes optimal mixed strategies
  • Pareto Optimality — Outcome where no one can gain without someone losing
  • Payoff — Value each player receives from a combination of actions
  • Bimatrix Game — Two-matrix games where mixed equilibria need not be zero-sum