For each one of the following four versions of the prisoner's dilemma, find the range of discount factors ₁ and 2 such that cooperation (the outcome (C, C)) can be sustained as a subgame perfect equilibrium if the game is repeated infinitely many times: C D C 5,7 6, -1 D -2,9 0,0 1 C D C 3,2 4, -2 D -1,5 0,0

For each one of the following four versions of the prisoner's dilemma, find the range of discount factors ₁ and 2 such that cooperation (the outcome (C, C)) can be sustained as a subgame perfect equilibrium if the game is repeated infinitely many times: C D C 5,7 6, -1 D -2,9 0,0 1 C D C 3,2 4, -2 D -1,5 0,0

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

rock paper scissors rock 0. -3 0. раper scissors -1 -1 3. 0. (a) Show that xT= (,) and yT= (,) together are not a Nash equilibrium 3' 3 3131 for this modified game.
For the friend-foe game, recall that there were 3 Nash equilibria possible, but the equilibria set didn't include the cooperative outcome, for which both players would win. Friend Foe Friend 500,500 0,1000 Foe 1000,0 0.0 a) If the game is played répeatedly. propose a play strategy that will enforce cooperation. For what valucs of o (discount factor) the equilibrium will be (Friend. Friend)?
(a) Consider the following bimatrix of a normal form game. Show that the set of strategies that survive elimination of weakly dominated strategies depends on the order in which the weakly dominated strategies are eliminated. Player 2 L R 1,1 0,0 M| 1,1 0,0 | 2,1 Player 1 2,1 (b) Find an example of a game where the unique Nash equilibrium in pure strategies would not survive the eliminination of weakly dominated strategies. (c) Find an example of a game where both players' strategies are weakly dominated in the Nash equilibrium.
H3. Cooperation in a Finite Game We have seen that if we play the Prisoners' dilemma with finite repetition, there will be no cooperation in the subgame-perfect equilibrium. There are other games, however, when cooperation can be enforced for at least some time in a finite repetition as well. Give an example with explanation. (Hint: consider games with more than one Nash equilibria.)
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.
1. Consider the following normal form game: Player 2 Player 1 U (2,2) (1,6) Find the mixed-strategy Nash equilibrium, supposing that this is a simultaneous non- repeated game.
(a) Design a two-player game with the property that "the payoff for Player1 is Playerl plays a strategy Sl and Player2 plays a strategy S2 is the same as the payoff for Player2 if Player2 plays Sl and Playerl plays S2". Express your game in terms of payoff matrices. Show the above property holds in your given payoff matrices. Give a case to show that there is one Nash equilibrium and such an equilibrium is also a Pareto efficient (justify your answers) in your given payoff matrices. Prove or disprove the above case that is unique. Give another example to show that there are two Nash equilibria in your given payoff matrices.
a) Draw an extensive form game with 4 outcomes (2 moves for player 1 followed by 2 moves for 2 after each of 1's moves) and no pure strategy Nash equilibrium. b) Write the strategic form to verify your answer to (a) c) Draw an extensive form 2-player game, in which both players always move, that has exactly 4 outcomes, 1 subgame perfect Nash equilibrium and no non-subgame perfect Nash equilibrium and no dominant strategies. d) Write the strategic form and use it to verify your answer to (b)
7) What is a repeated game? Why are repeated games useful to consider? What is the difference between finitely repeated games and infinitely repeated games? Provide an example of a political situation that would be usefully modeled with a repeated game.
Construct the normal representation and the fully reduced normal representation of the game shown in Figure 1. 0 (0.5) (0.5) 1.r 1.s W1 X1 y1 Z1 0,0 2.t 2.t 0,4 a2 b2 a2 b2 Figure 1: Extensive-form game 2,-2 -2,2 -2, 2 2,-2
A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?
Two farmers have unlimited access to a common plot of land and can let their cows graze on it. The matrix below shows the benefits they get from grazing either 1 or 2+ cows on the land. Farmer 2 Farmer1 1 cow 2+ cows 1 cow 8,8 2,10 2+cows 10,2 4,4 What kind of game is this? What is/are the Nash equilibrium/equilibria? What is/are the Pareto efficient outcome(s) in this game? (Hint: Remember that Pareto efficiency occurs when no one person can be made better off without someone else being made worse off) The government offers a reward or subsidy for communities where farmers only allow 1 cow to graze on the common field, resulting in a new payoff matrix:…