For the same game (player chooses /; ; player chooses or player chooses or ), the number of subgame perfect Nash equilibria is
Tap an option to check your answer.
For the same game (player chooses /; ; player chooses or player chooses or ), the number of subgame perfect Nash equilibria is
Tap an option to check your answer.
Checking your account…
For the same game (player 1 chooses L / R; L→(1,0); R→ player 2 chooses U→(0,2) or D→ player 1 chooses L→(4,0) or R→(3,3)), the number of subgame perfect Nash equilibria is (A) one subgame perfect Nash equilibrium (B) two subgame perfect Nash equilibria (C) three subgame perfect Nash equilibria (D) no subgame perfect Nash equilibria
Also written as: For the same game (player 1 chooses L / R; L->(1,0); R-> player 2 chooses U->(0,2) or D-> player 1 chooses L->(4,0) or R->(3,3)), the number of subgame perfect Nash equilibria is
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.