6 1. Consider a repeated game G = (g, T, 3), where there are two players and the stage game g is:Player 2C D0,yD y,0 1,1Player 1 Cr, x(a) Suppose that the stage game is repeated a finite number of times (T<∞o). For whichvalues of x and y is there a unique, pure-strategy subgame perfect Nash equilibrium for allvalues of 0 < 5₁ < 1 and 0 < 8₂ <1? Write your answer as inequalities using r and y, andshow your work.I(b) Suppose that the stage game is repeated a infinite number of times (T= ∞). For whichvalues of r and y is there a unique, pure-strategy subgame perfect Nash equilibrium for allvalues of 0 < 5₁ < 1 and 0 < 6₂ < 1? Write your answer as inequalities using r and y, andshow your work. (If you are not able to derive the inequalities, give examples of r and y forwhich there is a unique SPNE.)(c) Suppose that the game is repeated infinitely (T=x), and that y>r>1. Describe thestrategies of players 1 and 2 for which there exist minimal 0 < d < 1 and 0 < 6₂ <1 suchthat an outcome of (r, r) in every round is obtainable. Derive the algebraic expressions for diand d2 necessary to sustain this outcome.(d) No one lives forever, and yet economists model and contemplate infinitely repeatedgames. Can you justify such an assumption of T = oc? By way of example, explain whyT = ∞ may be appropriate or argue why you believe it is never appropriate.

A repeated game is a type of game in the field of game theory where the same basic game or stage…

Answered: 1. Consider a repeated game G = (g, T,…

1. Consider a repeated game G = (g, T, 3), where there are two players and the stage game g is: Player 2 C D Player 1 Cr, 0,y D y,0 1,1

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

Consider again the normal form of the Prisoner's dilemma game. Determine any Nash Equilibrium. Player 2 R (-10,-10) (-1,-25) (-25,-1) (-3,-3) C Player 1 R
(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.
8) Find the mixed strategy Nash equilibrium of the following normal form game. Player 2 T1 T2 T3 2, 3 3, 5 1, 1 Player 1 S2 1, 4 4, 3 0, 5 Player 1 attaches probability (S1, S2) = () and Player 2 attaches probability (T1, T2, T3) = ( ) Player 1 attaches probability (S1, S2) = (.) and Player 2 attaches probability (T1, T2, T3) = (qi, 42, 1 – q1 – 92) where q1 , and 0 < q2 S %3D Player 1 attaches probability (S1, S2) = (G,;) and Player 2 attaches probability (T1, T2, T1) = (qı.42, 1 – q1 – 42) where 0 < qi <, and q2 = 3. Player 1 attaches probability (S1, S) = (;, -) and player 2 attaches probability (T1, T2, T3) = (1.42, 1- q1- 42) where 0 s qı s and q2 =
Refer to Table Left-Right-ZigZag. How many pure strategy Nash equilibria does this game have? Table: Left-Right-ZigZag Player 1 Drive left Driver right Zigzag 1) 1 2) 2 3) 3 4) 4 5) None of the above. Drive left (1,1) (-1,-1) (0,0) Player 2 Driver right (-1,-1) (1,1) (0,0) Zigzag (0,0) (0,0) (0,0)
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.
Consider the following game. Firm 1 can implement one of two actions, A or B. Firm 2 observes the action chosen by Firm 1 and then decides whether to fight it or not. (-10, 20) F2 Fight A Don't fight -(30, 10) Firm 1 (-10, 0) Fight B Don't fight -(20, 15) (a) Consider the following strategy profile: Firm 1 chooses A; Firm 2 chooses fight if A, and fight if B. • this strategy profile is [Select] (b) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses fight if A, and don't fight if B. • this strategy profile is [Select] O (c) Consider the following strategy profile: Firm 1 chooses B; Firm 2 chooses don't fight if A and don't fight if B. • this strategy profile is [Select] 00 F2 ()
Two business partners jointly own a firm and share equally the revenues. They individually and simultaneously decide how much effort to put into the firm. Let s₁ and s2 denote the effort choices of partner 1 and partner 2, respectively. Assume si € [0, 4]. The cost of effort is given by s? for i E {1, 2}. The firm's revenue is given by 4(81 +82 + bs182) where 0 ≤ b ≤ 1. (Note that the parameter 6 reflects the synergies between the effort levels. b> 0 implies that the more one partner works, the more productive the other partner is.) The payoffs for partners 1 and 2 are: u₁ (81, 82) u2 (81, 82) - = 1 [4(81 +82 +68182)] − 8² - 1 [4(81 +82 + bs182)] – $²
Consider the following simultaneous game: Player 1 U D Player 2 L 20,-10 -10, 20 R -10, 20 20,-10 Please indicate whether each of the following statements is true or false. Player 1 has a dominant strategy. This game has a Nash equilibrium. This game has a Nash equilibrium in pure strategies. Player 1's best response is D if player 2 plays R.
In the following symmetric general sum game (2, 2) (0,0) (0,0) (0,0) (0,0) (2, 2) (0,0) (2,2) (0,0) (i) Find all pure Nash equilibria. (ii) Find all mixed Nash equilibria in which all probabilities are positive. (vi) Which of these are evolutionary stable strategies?
Consider a two-player game in which the players take turns, with player 1 moving first. When it is a player's turn, she must announce a number between 1 and 3. The announced number is added to the previously announced numbers. The player who announces the number such that the sum of all announced numbers is 6 wins (receives 1) and the other loses (receives 0). Please indicate whether or not each of the following sequences of announcements is a Nash equilibrium of the game. Hint: Think about how one verifies whether or not a pair of strategies is a Nash equilibrium. P1 says 3, then P2 says 2, then P1 says 1 P1 says 1, then P2 says 3, then P1 says 2 P1 says 2, then P2 says 3, then P1 says 1 P1 says 3, then P2 says 1, then P1 says 2
Which is false for the following game? C R. T. 3, 2 0,3 3, 3 M 5,0 4, 1 3, 1 B 2, 2 4, 5 1, 1 A. (M,C) and (B,C) are the only pure strategy Nash Equilibria OB. There is a Nash cquilibrium in which R is played with positive probability C. There is no Nash equilibrium in which L is played with positive probability OD. There is no Nash equilibrium in which both players choose two of their actions with positive probability
A large group of players each guesses a number between 0 and 300. The winner is the person whose number is closest to three-fifth of the average guess. What is the Nash equilibrium? Will it be observed? What do you expect for the outcome of this game with next year's 203 class? (Considering that they have similar sophistication to your class but they have not covered game theory yet.)