Player moves first and chooses or . ends the game with payoffs (payoffs are (player , player )). If , player chooses or : ends it with ; lets player choose or , giving or respectively. This game has
Tap an option to check your answer.
Player moves first and chooses or . ends the game with payoffs (payoffs are (player , player )). If , player chooses or : ends it with ; lets player choose or , giving or respectively. This game has
Tap an option to check your answer.
Checking your account…
Player 1 moves first and chooses L or R. L ends the game with payoffs (1,0) (payoffs are (player 1, player 2)). If R, player 2 chooses U or D: U ends it with (0,2); D lets player 1 choose L or R, giving (4,0) or (3,3) respectively. This game has (A) one Nash equilibrium in pure strategies (B) two Nash equilibria in pure strategies (C) three Nash equilibria in pure strategies (D) no Nash equilibria in pure strategies
Game theory and strategic behaviour has come up 61 times in 6 exams since 2008.
This question is on Extensive-form games and backward induction, part of Game theory and strategic behaviour in Game Theory.
Games played in sequence, solved from the end back to the start.
TestStop has 16 past-paper questions on this subtopic.
Question from the DSE 2020 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.