Mixed strategies: the graphical method
Studying this course? Keep your progress in one place.
Key facts
- A mixed strategy plays each strategy with a fixed probability, chosen at random each time.
- Rose's expected pay-off against a column is the sum of probability of row entry.
- For a game plot a line per column and find the highest point of the lower boundary.
- For an game plot a line per row and find the lowest point of the upper boundary.
- State every probability, including zeros; the value is the long-run average gain to Rose.
Mixed strategies
With no stable solution, play each strategy with a fixed probability. Rose's expected pay-off weights each entry by its probability.
When a game has no stable solution, a player who always uses the same pure strategy can be exploited. A mixed strategy chooses each strategy with a fixed probability, at random each time. Rose plays row with probability , with .
Against any single column, Rose's expected pay-off is the sum of (probability of row entry). Both rows must be weighted: and .
Her optimal maximises the worst of these, where they are equal.
Worked example
For Rose plays row 1 with probability . Find her optimal strategy and the value of the game.
- 1
Against column 1: .
- 2
Against column 2: .
- 3
Her optimal strategy makes these equal: .
- 4
, so . Value .
Rose plays row 1 with probability . Against a column with entries 3 (row 1) and 7 (row 2), her expected pay-off is...
The graphical method
Plot Rose's expected pay-off against each column as a line. She picks at the highest point of the lower boundary.
If Rose has two rows and Colin has columns (), let Rose play row 1 with probability , . Each column gives a straight line for her expected pay-off against that column.
Colin will choose the column worst for her, so her guaranteed pay-off is the lowest line at each (the lower boundary).
She picks at the highest point of the lower boundary, where an increasing line meets a decreasing one. The height there is the value of the game.
Example: gives lines , and . They meet where , so and the value is .
The lines and meet at which value of ?
The other player's strategy
The two lines meeting at the peak show which columns Colin uses. Solve that game for him and give the others probability 0.
The two lines that meet at the peak tell you which of Colin's columns he actually uses, and only those two columns are played.
Solve the resulting game for Colin: let him play one of the two columns with probability , make Rose's expected pay-off equal for both rows, and solve for . His other columns have probability 0.
State the probability for every strategy, including those never played.
- Column 1
- Column 2
- Column 3
Worked example
Continue the example using columns 2 and 3. Colin plays column 2 with probability .
- 1
Row 1 gives .
- 2
Row 2 gives .
- 3
Equate: , so .
- 4
Value .
Colin has 3 columns and only columns 1 and 3 are on the optimum. What probability does column 2 get?
The method
Work from Colin's side with probability on column 1, and find the lowest point of the upper boundary.
If Rose has rows and Colin has two columns, let Colin play column 1 with probability .
Each row gives a line for Rose's expected pay-off, and Colin picks to minimise the highest line: the lowest point of the upper boundary.
Example: gives , , . The upper boundary is lowest where rows 1 and 2 meet: , so and the value is . Row 3's line is only there.
Rose then plays only rows 1 and 2: gives .
In an game, which point on the graph does Colin choose?
Exam method and interpretation
Define or , write and plot the lines, find the optimum by equating two lines, state every probability, and interpret the value.
Follow the same steps every time.
Check your answer by substituting into every line: the lines for unused columns must give at least the value.
A value of 3.4, for example, means Rose wins 3.4 on average per play in the long run, not exactly 3.4 each time. A positive value favours Rose.
- 1
Define
state p or q and for which strategy
- 2
Lines
write each in simplified form and plot or sketch them
- 3
Optimum
highest point of the lower boundary, or lowest point of the upper boundary; equate the two lines
- 4
State strategies and value
both players, with zero probabilities
- 5
Interpret
the value is the average gain per play in the long run
What does a value of 3.4 mean in context?
Try an exam question
Rose's pay-off matrix is . Rose plays row 1 with probability . Find her optimal value of and the value of the game.
[4 marks]
- [1]Against column 1 Rose's expected pay-off is .
- [1]Against column 2 it is .
- [1]Equating: , so .
- [1]The value of the game is 2.
That's the notes covered.
Carry on to the next subtopic.
Try a question
Which expression is Rose's expected pay-off when Colin plays column 1?
1 mark, marked against the mark scheme
Which expression is Rose's expected pay-off when Colin plays column 1?
1 mark, marked against the mark scheme