Mathwords logoMathwords

Pure Strategy — Definition, Formula & Example

A pure strategy is a complete plan of action in which a player commits to one specific choice in every situation that could come up, with no use of chance. It is the special case of a mixed strategy that puts all its probability on one choice; a truly mixed strategy randomizes among choices.

In a normal-form game, a pure strategy for player ii is a single element sis_i of that player's strategy set SiS_i. Equivalently, it is a mixed strategy that assigns probability 11 to one element of SiS_i. In an extensive-form (sequential) game, a pure strategy is a function that assigns one available action to each of player ii's information sets, including information sets that are never reached in actual play.

Key Formula

∣Si∣=∏h∈Hi∣A(h)∣|S_i| = \prod_{h \in H_i} |A(h)|
Where:
  • ∣Si∣|S_i| = Number of pure strategies available to player i
  • HiH_i = Set of information sets (decision points the player can tell apart) where player i moves
  • ∣A(h)∣|A(h)| = Number of actions available at information set h

Worked Example

Problem: Coffee Shop A sets its latte price at either High or Low. Coffee Shop B sees A's price and then picks one of three responses: Match, Undercut, or Ignore. How many pure strategies does each shop have, and how many pure-strategy profiles does the game have?
Step 1: Shop A moves once and has 2 actions, so each pure strategy is a single price.
∣SA∣=2|S_A| = 2
Step 2: Shop B has 2 decision points, one after seeing High and one after seeing Low. A pure strategy must name a response at both, for example "Match if High, Undercut if Low." Each decision point offers 3 actions.
∣SB∣=3×3=9|S_B| = 3 \times 3 = 9
Step 3: A pure-strategy profile pairs one pure strategy from each shop. Multiply the counts.
∣SA∣×∣SB∣=2×9=18|S_A| \times |S_B| = 2 \times 9 = 18
Answer: Shop A has 2 pure strategies, Shop B has 9, and the game has 18 pure-strategy profiles.

Why It Matters

In an intermediate microeconomics or game theory course, you usually check each pure-strategy profile for a Nash equilibrium before trying mixed strategies. Nash's theorem guarantees that every finite game has an equilibrium in mixed strategies. It does not guarantee one in pure strategies, so you need to know which kind you are looking for.

Common Mistakes

Mistake: Listing only Shop B's actions (Match, Undercut, Ignore) as its pure strategies, which gives 3 instead of 9.
Correction: A pure strategy for a later mover is a full contingency plan. It must name an action for every situation the player could face, even ones that will not happen in a given play of the game.

Related Terms