Consider the payoff matrix below, which describes a symmetric A B A 17,17 0,14 B 14,0 8,8 (a) Find all Nash equilibria of this game, including any mixed strategy equilibria. (b) Draw the expected payoff difference diagram for this game, including all the Nash equilibria you found in (a). (c) What would you expect to occur most frequently when this game is played as a lab experiment? Justify your answer using your answers from (a) and (b).

Consider the payoff matrix below, which describes a symmetric A B A 17,17 0,14 B 14,0 8,8 (a) Find all Nash equilibria of this game, including any mixed strategy equilibria. (b) Draw the expected payoff difference diagram for this game, including all the Nash equilibria you found in (a). (c) What would you expect to occur most frequently when this game is played as a lab experiment? Justify your answer using your answers from (a) and (b).

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors rock 0. -3 1 1. раper scissors -1 -1 3 (a) Show that xT= (,) and yT= (5) together are not a Nash equilibrium 3'31 for this modified 3'3 game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
please solve it in 30 minute please Consider an infinitely repeated game where the stage game is the game of chicken: Swerve Straight Swerve 0,0 -1,1 Straight 1, –1 -10, -10 Assume that the discount factor is very close to one. For concreteness, you can assume that d = 0.99. (a) Is there an SPE in which player l's payoff is 1/(1 – 6)? Explain. (b) Is there an SPE in which each player gets a payoff of 0? Explain. (c) Is there an SPE in which player l's payoff is -2/(1 – 8)? Explain.
rock paper scissors гock 0. -3 1 рарer 1. -1 scissors -1 3 0. (a) Show that xT= ( ) and yT= (3) together are not a Nash equilibrium 3 3 313 for this modified game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
Consider the attached extensive-form game tree, where player 1 moves first, then player 2. The top payoff accrues to player 1, the bottom payoff to player 2. (a) Draw the strategic form for this extensive form game. (b) Find all of the Nash equilibria, including any mixed. (c) Which of these Nash equilibria do you think would be actually played? Why? A 2 D 20 2 2 S P 3 33
3. 1 2 J K 2 1 2 0 0 K 3 3 E/ 1.1 2.2 B G 2 -2 a.) How many Subgames does this Game have? b.) Convert this Game Tree into matrix form. c.) Find all Pure Strategy Nash Equilibria of this Game. d.) Find all Subgame Perfect Nash Equilibria of this Game. (Pure and Mixed) 2 2.2
NE 2). Consider the following extensive form game between two players. (1,10) u D 1 B X (a) List all pure strategies of player 2. (b) Represent this game in normal form. (c) Find all pure-strategy Nash equilibria of this game. (d) Find all SPNE (in pure strategies) of this game. (6,3) (4,2) (5,1)
Consider the following two-player game with three options for each player. (Payouts are listed for the row player first, then the column player.) player Y layery 3,3 A 1,5 4,4 6,2 K 8,1 3,7 5,2 0,6 1,1 Find a mixed Nash equilibrium for this game. Solution suggestion: Use two variables per player. If p and are the probabilities of selecting the first two strategies, then 1-p-q is the probability of selecting the third strategy. You will need to solve a system of equations.
Help me please
2. Consider a two-player non-zero-sum game with payoff matrix given by (3, 4) (1,1) (-1,2) (7,3) (a) Determine the safety values for each of the players. (b) Now suppose that the players choose to collaborate in the given game. Sketch the payoff polygon, and show clearly the location of the status quo point and the negotiation set. (c) Determine the Nash bargaining solution for the given game.
Consider the following game: Player 2 In Out Player 1 In -2,-2 2, 0 Out 0, 2 0, 0 (a) What is the Nash equilibrium of this game, or what are the Nash equilibriaof this game? (b) Does either firm have a dominate strategy (a strategy that is always abest response)? Which? (c) Suppose Player 1 could move before Player 2 and Player 2 could observe Player 1’s move. What do you think would happen?
Consider the following extensive-form game. U D A B A B -6,6 X Y X Y P 3,8 -8, 1 1,2 -2, 1 5,5 -0,0 The dashed lines represent information sets. (a) Represent this game in normal-form. (b) Derive the Nash equilibria in pure strategies. (c) Describe the (proper) subgames of this game. (d) Derive the subgame perfect Nash equilibria in pure strategies.
Question 1 Consider the following game. Find all Nash equilibria, subgame perfect Nash equilibria, and weak perfect Bayesian equilibria in pure and mixed strategies. a P2 (12, 12) b (12,-8) (7.-3) P1 m d (-3,2) r P2 C (2,7) d (22,17)