Consider the following two-player game in which each player has 3 pure strategies.
| Player 2 | ||||
|---|---|---|---|---|
| L | C | R | ||
| Player 1 | U | 4, 3 | 5, 1 | 6, 2 |
| M | 2, 1 | 8, 4 | 3, 6 | |
| D | 3, 0 | 9, 6 | 2, 8 |
Find the strategies that survive iterated elimination of strictly dominated strategies.
Tap an option to check your answer.
Checking your account…
Game theory and strategic behaviour has come up 61 times in 6 exams since 2008.
This question is on Normal-form games and dominance, part of Game theory and strategic behaviour in Game Theory.
Games in matrix form, and solving them by removing strategies that are never best.
TestStop has 6 past-paper questions on this subtopic.
Question from the JNU SIS 2019 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.