Consider the following game: P2 L C R 1,2 4,3 6, 5 1,5 2,7 4, 3 D 2, 43, 25, 2 ● U P1 M Identify the undominated strategies of P1 and P2. . Which strategies are rationalizable? . Find all the Nash equilibrium of this ame. Illustrate your answer by a clearly labelled best response graph, with P1's strategy on the x-axis and P2's strategy on the y-axis.

Consider the following game: P2 L C R 1,2 4,3 6, 5 1,5 2,7 4, 3 D 2, 43, 25, 2 ● U P1 M Identify the undominated strategies of P1 and P2. . Which strategies are rationalizable? . Find all the Nash equilibrium of this ame. Illustrate your answer by a clearly labelled best response graph, with P1's strategy on the x-axis and P2's strategy on the y-axis.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

Consider the following simultaneous move game: Player 1 U M D Player 2 L 2,10 2,5 8,7 C 5,2 11,8 8,4 R 5,4 2,9 8,3 In the Nash equilibrium of this game, player 1 receives a payoff of ✓ and player 2 receives a payoff of
Consider the following simultaneous move game where player 1 has two types. Player 2 does not know if he is playing with type a player 1 or type b player 1. Player 2 C D Player 1 A 12,9 3,6 B 6,0 6,9 C D A 0,9 3,6 B 6,0 6,9 Type a Player 1 Prob = 2/3 Type b Player 1 Prob = 1/3 Find the all the possible Bayesian Nash Equilibriums (BNE) of this game.
Consider the following two player game: Player 1 ABCD X 1,2 4,1 5,2 2,3 Player 2 Y 2,2 3.5 1 4,4 0.4 Z 5.1 3,3 7,0 7,5 a. Find the strategies that survive iterated elimination of weakly and strictly dominated strategies. b. Find the best responses to each strategy and find all (pure strategy) Nash equilibria.
The following table contains the possible actions and payoffs of players 1 and 2. Player 1 U M D L 2,10 2,5 8,7 Player 2 C 5,2 11,8 8,4 R 5,4 2,9 8,3 This is a simultaneous move game. In a pure strategy Nash equilibrium of this game, Player 1 receives a payoff of ✓and player 2 receives a payoff of If, instead of playing simultaneously, player 2 moves first, then in the Nash equilibrium player 1 receives a payoff of ✓and player 2 receives a payoff of
Let G be the following static game. Rose Colin A A (3,4) B (4,2) B (1,5) (0, 1) (a) Determine the pure Nash equilibria of G. (b) Rose A, B, Colin A, B is a mixed Nash equilibrium of H. (You do not have to verify this.) Determine the expected payoffs of both players given that they choose their strategies according to this Nash equilibrium. (c) Draw the payoff polygon of H. Indicate on your diagram the points corresponding to the Nash equilibria of H, and the points corresponding to Pareto optimal solu- tions of H.
Consider the following sequential game: 1 O D,L U.L U,R U D,R D (0,2) 2 L What is the subgame perfect Nash equilibrium of this game? R. (-1,-1) (1,1)
2. Consider the following game: u 1 r 6,0 0,6 d 3,2 6,0 Are there any Nash equilibria in pure strategies for this game? Find the mixed strategy Nash equilibrium.
Consider the following game : Stag Rabbit Stag 9, 9 0, 8 Rabbit 8, 0 7, 7 The first payoff is that of player 1 and the second that of player 2. a. ) Draw the extensive form of the simultaneous game. Find all the Nash equilibrium. p. Suppose player 1 moves first or we are in a sequential game now. Draw the extensive form in the sequential version. c. What is the subgame perfect Nash Equilibrium (SPNE) in the sequential version? d. ) Explain why it is an SPNE.
Q1 Consider the following normal-form game: L C U ?,? 0,8 M 8,0 2,2 D 2,4 4,4 R 4,4 10, 10 6,6 Fill in the first cell in the above matrix such that: a) The Nash equilibrium couple of strategies is (M, R). Explain. b) The Nash equilibrium couple of strategies is (U, L). Explain. c) U and I are non-rationalizable strategies. Explain. d) There exists a Nash equilibrium in dominated strategies. Explain.
Iterative Elimination of Dominated Strategies Exercise 4.2 Consider the following normal form of a game. Use IEDS to reduce this game and find any Nash Equilibrium. X Y Z (60,50) (50,110) (70,90) (100,60) (70,70) (110,100) (110,70) (100,110) (40,40)
how many Nash equilibrium/equilibria are there in this game? please refer to figure provided
Consider the following two-player game for a, b, c, d E R., II A I a 1 2 0. d. i) Assume we know that there is a mixed Nash equilibrium in which both players play each of their strategies with strictly positive probability. Compute such a Nash equilibrium.