Dominance and mixed strategies
Studying this course? Keep your progress in one place.
Key facts
- A dominated strategy is never better than another, so remove it; repeat until nothing more can be removed.
- Rowan (maximiser) prefers larger entries; Colin (minimiser) prefers smaller entries.
- A mixed strategy plays each strategy with a stated probability, and the probabilities sum to 1.
- For a game, Rowan's optimal makes his expected pay-offs against the two columns equal.
- For games draw the lines and take the highest point of the lower boundary.
Dominated strategies
A strategy is dominated if another is at least as good in every case, so a sensible player never uses it.
Remove dominated rows and columns to get a smaller game. Repeat, because removing a row can make a column dominated and vice versa.
Say which row or column dominates which, and quote the entry-by-entry comparison.
Rows (Rowan maximises)
- Row is dominated by row
- if every entry of is greater than or equal to the matching entry of
Columns (Colin minimises)
- Column is dominated by column
- if every entry of is less than or equal to the matching entry of
Worked example
Reduce using dominance.
- 1
Row 3 is at least row 1 in every entry, so row 3 dominates row 1. Remove row 1.
- 2
Column 1 is at most column 3 in every entry, so column 1 dominates column 3 for Colin. Remove column 3.
Column and column are Colin's. Which is dominated?
Mixed strategies
If there is no stable solution, a player should choose strategies at random with set probabilities.
A player who always makes the same choice can be exploited. A mixed strategy chooses each strategy with a stated probability, at random each time.
Rowan plays row 1 with probability and row 2 with probability . His expected pay-off against each of Colin's columns is a linear expression in .
The optimal mixed strategy maximises the smallest of these. For a game that happens where the two expected pay-offs are equal, and the result is the value of the game.
- Rowan's mixrow 1 with probability , row 2 with
- Optimal in a gameexpected pay-offs are equal
Rowan plays row 1 with probability in a game. What is the probability of row 2?
Solving a 2×2 game
Write Rowan's expected pay-off against each column in terms of , then equate them.
For there is no stable solution: maximin and minimax .
Rowan plays row 1 with probability and row 2 with probability , and we equate his expected pay-off against each column. The graph shows the two expected pay-offs meeting at the optimum.
Worked example
Find the optimal mixed strategies and the value for .
- 1
Against column 1: .
- 2
Against column 2: .
- 3
Equate: , so and . Value .
- 4
For Colin, play column 1 with probability . Against row 1 the pay-off is , against row 2 it is .
- 5
Equate: , so . Value again.
For , Rowan plays row 1 with probability . Which equation gives his optimal ?
Graphical method for 2×n games
Draw Rowan's expected pay-off against each column as a line in ; the highest point of the lower boundary is optimal.
If Rowan has two strategies and Colin has , write Rowan's expected pay-off against each column as a line in and draw the lines on one set of axes.
Colin chooses the column that gives Rowan least, so Rowan's guaranteed pay-off is the lower boundary. His optimal is at its highest point, and the height there is the value of the game. Any line above that point is a column Colin never plays.
Example: gives lines , and . The first two meet at with value , and the third is there.
If Rowan has strategies and Colin has two, use for Colin and find the lowest point of the upper boundary of the lines.
In the graph, which column does Colin never play, and why?
Try an exam question
The pay-off matrix to Rowan is . Show that there is no stable solution, and find Rowan's optimal mixed strategy and the value of the game.
[5 marks]
- [1]Maximin and minimax are not equal, so there is no stable solution.
- [1]Against column 1: .
- [1]Against column 2: .
- [1]Equating: , so .
- [1]The value of the game is .
That's the notes covered.
Carry on to the next subtopic.
Try a question
Which statement about dominance in this game is correct?
1 mark, marked against the mark scheme
Which statement about dominance in this game is correct?
1 mark, marked against the mark scheme