(9) Suppose the following game is played an infinite number of times. Denote the discount factor d. Assume higher payoffs are more desirable. Player 1 C D Player 2 C D 6,3 0,10 3,0 10,0 (a) What is the payoff to each if both players always play C? (b) What is the payoff to each if both players always play D? (c) Suppose both players employ a Grim Trigger strategy. What value of d is required for this to be a Nash equilibrium?

(9) Suppose the following game is played an infinite number of times. Denote the discount factor d. Assume higher payoffs are more desirable. Player 1 C D Player 2 C D 6,3 0,10 3,0 10,0 (a) What is the payoff to each if both players always play C? (b) What is the payoff to each if both players always play D? (c) Suppose both players employ a Grim Trigger strategy. What value of d is required for this to be a Nash equilibrium?

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.7P

See similar textbooks

Similar questions

You and a rival are engaged in a game in which there are three possible outcomes: you win, your rival wins (you lose), or the two of you tie. You get a payoff of 50 if you win, a payoff of 20 if you tie, and a payoff of 0 if you lose. What is your expected payoff in each of the following situations? (a) There is a 50% chance that the game ends in a tie, but only a 10% chance that you win. (There is thus a 40% chance that you lose.) (b) There is a 50–50 chance that you win or lose. There are no ties. (c) There is an 80% chance that you lose, a 10% chance that you win, and a 10% chance that you tie.
Suppose the following game is played infinite times in the future. Time discount is 0.90. What should be the value of x so that the equilibrium strategy is (Cooperate, Cooperate)? Player 2 Player 1 Cooperate Defect Cooperate (x, x) (2, 14) Defect (14, 2) (5, 5)
Mohamed and Kate each pick an integer number between 1 and 3 (inclusive). They make their choices sequentially.Mohamed is the first player and Kate the second player. If they pick the same number each receives a payoff equal to the number they named. If they pick a different number, they get nothing. What is the SPE of the game? a. Mohamed chooses 3 and Kate is indifferent between 1, 2 and 3. b. Mohamed chooses 3 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2, and 3 if Mohamed chooses 3. c. Mohamed chooses 1 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2 and 3 if Mohamed chooses 3. d. Mohamed chooses 3 and Kate chooses 3.
Determine the optimum strategies and the value of the game with the followingpayoff matrix of player A where A1, A2 are the strategies for player A and B1, B2 are for player B.B1 B2A1 5 1A2 3 4
Find all NE of the stage game.(b) Consider a two-period game without discounting in which the stage game is played ineach period. Find all pure strategy SPNE.(c) What’s the min-max payoff of each player?(c1) Consider pure strategies only.(c2) Consider all strategies, including the mixed ones.(d) Now suppose the stage game is repeated infinitely many times. Use the Fudenberg-Maskin Folk theorem to find all possible values of payoff that can be supported as aSPNE.
A strategy is a decision rule that describes the actions a player will take at each decision point. The normal-form game indicates the players in the game, the possible strategies of the players, and the payoffs to the players that will result from alternative strategies. In the game presented in Table Normal-Form Game, does player B have a dominant strategy? What is the secure strategy for player B in the game presented in Table Normal-Form Game?
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
A strategy for player 1 is a value for x1 from the set X. Similarly, a strategyfor player 2 is a value for x2 from the set X. Player 1’s payoff is V1(x1, x2) =5 + x1 - 2x2 and player 2’s payoff is V2(x1, x2) = 5 + x2 - 2x1.a. Assume that X is the interval of real numbers from 1 to 4 (including 1and 4). (Note that this is much more than integers and includes such numbers as 2.648 and 1.00037). Derive all Nash equilibria.b. Now assume that the game is played infinitely often and a player’s payoff is the present value of his stream of single-period payoffs, where dis the discount factor.(i) Assume that X is composed of only two values: 2 and 3; thus, aplayer can choose 2 or 3, but no other value. Consider the followingsymmetric strategy profile: In period 1, a player chooses the value 2. In period t(≥2), a player chooses the value 2. In period a player chooses the value 2 if both players chose 2 in all previous periods; otherwise, she chooses the value 3. Derive conditions which ensure…
What is the payoff for both players in the SPNE of this game?-(2,5)-(3,4)- (2,2)- (5,1)- (1,7)
Choose the correct answer. A strategy AA is "dominant" for a player X if: A. Every outcome under strategy AA generates positive payoffs. B. Irrespective of any of the possible strategies chosen by the other players, strategy AA generates a higher payoff than any other strategy available to player X. C. Strategy AA is the best response to every strategy of the other player. D. Strategy AA contains among its outcomes the highest possible payoff in the game. E. Strategy AA is the best response to the best strategy of the other player.
* Please be advised this is for practice preperation only ** i just really need help on this - I dont undertsand X is an arbitrary number Suppose the stage game was played for 3 rounds. Consider the following strategy: Round 1: play C. Round 2: play C if both players played C in round 1. Otherwise, play E. Round 3: play D if both players played C in rounds 1 and 2. Otherwise, play E.Ignore discounting (that is, δ = 1). Suppose that both players pick the strategy above. What condition on x is needed to make this strategy profile a SPNE? Hint: remember to check for possible deviations separately for rounds 1 and 2.(a) 5 ≥ x(b) 7 ≥ x(c) 9 ≥ x(d) 11 ≥ x(e) 13 ≥ x
w= 7 To which strategy t2 is the strategy t1 = 4 a best response? (If your answer is afraction, report it in lowest terms.)