In a two-player game with , player 1 chooses U or D and player 2 chooses L or R. The payoff matrix is : and : across columns . Then the number of pure strategy Nash Equilibria in the game equals
Tap an option to check your answer.
In a two-player game with , player 1 chooses U or D and player 2 chooses L or R. The payoff matrix is : and : across columns . Then the number of pure strategy Nash Equilibria in the game equals
Tap an option to check your answer.
Checking your account…
In a two-player game with 0 < c < 1, player 1 chooses U or D and player 2 chooses L or R. The payoff matrix is U: (0,0),(0,-c) and D: (-c,0),(1-c,1-c) across columns L, R. Then the number of pure strategy Nash Equilibria in the game equals (A) 1 (B) 2 (C) 3 (D) 4
Game theory and strategic behaviour has come up 61 times in 6 exams since 2008.
This question is on Pure-strategy Nash equilibrium, part of Game theory and strategic behaviour in Game Theory.
Outcomes from which no player wants to deviate, and classic games that illustrate them.
TestStop has 20 past-paper questions on this subtopic; the nearest in year are below.
Question from the IIT JAM 2024 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.