Consider a repeated game with the following stage game:Player 1OOOCooperateNotCooperateThis game is repeated T-120 times, and t each period both players must choose their actions simultaneously. The players are deciding whether or not tocooperate specifically, whether or not to follow this cooperation strategy:r≤ 3S|S|AW|N N|H"Each player will play cooperate as long as no one has played Not Cooperate before. If someone has played Not Cooperate before, then each player will play NotCooperate forever."rs 5rsPlayer 2In this case, cooperation will be possible if the interest rate r isNotCooperate5,1510, 10None of the aboveCooperate12, 1215,5

Answered: Image /qna-images/answer/307f2ba3-0161-45f4-a2e1-12c3d961df04.jpg

Consider a repeated game with the following stage game: Player 1 IN N/M 556 Ors ²/3 Player 2 Ors = 5 Not Cooperate Cooperate 5, 15 Not Cooperate orso This game is repeated T-120 times, and at each period both players must choose their actions simultaneously. The players are deciding whether or not to cooperate specifically, whether or not to follow this cooperation strategy: 10, 10 "Each player will play cooperate as long as no one has played Not Cooperate before. If someone has played Not Cooperate before, then each player will play Not Cooperate forever." None of the above Cooperate In this case, cooperation will be possible if the interest rate r is 12, 12 15,5

Consider a repeated game with the following stage game: Player 1 IN N/M 556 Ors ²/3 Player 2 Ors = 5 Not Cooperate Cooperate 5, 15 Not Cooperate orso This game is repeated T-120 times, and at each period both players must choose their actions simultaneously. The players are deciding whether or not to cooperate specifically, whether or not to follow this cooperation strategy: 10, 10 "Each player will play cooperate as long as no one has played Not Cooperate before. If someone has played Not Cooperate before, then each player will play Not Cooperate forever." None of the above Cooperate In this case, cooperation will be possible if the interest rate r is 12, 12 15,5

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

Consider the following price game: Firm 1 Firm 2 High Low High 20, 20 12, 24 Low 24, 12 14, 14 Remark: In simultaneous move games (games with rows and columns) theconvention is to write the row player’s payoff first and the column player’spayoff second. (a) What is the Nash equilibrium of this game? Recall that for each playeryou should find the best response to each of the opponents’ strategies andunderline the associated payoff. Then look for a cell where both strategiesare best responses to each other. This is a Nash equilibrium. (b) Does either firm have a dominate strategy (a strategy that is always abest response)?
Solve for the Nash equilibrium (or equilibria) in each of the following games. (a) The following two-by-two game is a little harder to solve since firm 2’spreferred strategy depends of what firm 1 does. But firm 1 has a dominantstrategy so this game has one Nash equilibrium. Firm 2 Launch Don’tFirm 1 Launch 60, -10 100, 0 Don’t 80, 30 120, 0 What is the Nash equilibrium of this simultaneous-move game? (b) What would the outcome of this game be if instead firm 1 moved first and then, after seeing what firm 1 chose, firm 2 chose it strategy? In this case firm 1 doesn’t necessarily need to choose a best response, but firm 2 must choose a best response since it moves second.
4. Consider a two player game with Fred and Barney, who tal turns removing matchsticks from a pile. They start with 33 matchsticks, and Fred goes first. On each turn, ecach player may remove either one, two, three, four, or five matchsticks. The player to remove the last matchstick wins the game. What are the optimal strategies for each player? Who will win? b. Suppose now that they can remove up to six matchsticks, how will the optimal strategies change for- each player? a.
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.
Consider the extensive form game portrayed below. The top number at aterminal node is player 1’s payoff, the middle number is player 2’s payoff,and the bottom number is player 3’s payoff.a. Derive the strategy set for each player. (Note: If you do not want to listall of the strategies, you can provide a general description of a player’sstrategy, give an example, and state how many strategies are in thestrategy set.)b. Derive all subgame perfect Nash equilibria. c. Derive a Nash equilibrium that is not a SPNE, and explain why it isnot a SPNE.
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 this as a simultaneous-move (static) game: Player A Top Bottom Player B Left Right ETEL UU 1.b) Does any player have a dominant strategy in this game? Explain. 1.a) Write down the Best Response Correspondence for each of the two players. Molimonsbestich Quinit 1.c) Find all Nash Equilibria in pure strategies of this game. 1.d) Is there any Nash Equilibria in mixed strategies? If so, find it. Elekt
Keith and Blake play a simultaneous one-shot game given by the following table: Blake Left Right Тop 5.00. -5.00 0.00, -6.00 Kelth Bottom 6.00,0.co -2.00, 8.00 As there is no unique pure strategy Nash equilibrium, assume that each player plays each of his chcices half of the time. What is the average payoff for Keith? (Round to two decimals if necessary.) What is the aver age payoff for Blake? |(Round to two decimals if necessary)
ALBUS MINERVA N S Z MINERVA لی a C a b 3,3 ALBUS b 0,4 2,2 4 N S 15,2 1,3 13,1 For the above sequential game, both Albus and Minerva make moves in two possible situations. A number in purple indicates which node of the two for each of Albus and Minerva. Albus' strategy NS indicates a strategy of taking action N at node 1 and action 5 at node 4. Minerva's strategy ab indicates a strategy of taking action a at node 2 and action b at node 3. Adopt this format of writing strategies, find the subgame perfect Nash equilibrium. Fill in the blanks: The subgame perfect Nash equilibrium of this game is "Albus" Minvera"
The next 3 questions involve the following game. There are two players, a husband and wife. They can either be selfish (S) or selfless (U) in their marriage. If they choose to be selfish, then there is a negative ʻguilt’ payoff of g. The payoff matrix is below. Figure 1: The Marriage Game Wife S U S 10-g, 10-g 15-g, 2 U 2, 15-g 12, 12 Number left (right) of comma refers to H's (W's) payoff. 23. Suppose that g = 0. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 24. Suppose that g= 5. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). 25. Suppose that g = 10. What is the Nash equilibrium (or equilibria)? (A) (S, S). (B) (U, S) and (S, U). (C) (S, S) and (U, U) (D) (U, U). Husband
In the following simultaneous-move game, what is player 1's maximin strategy? Player 2 OL OR OU OD Player 1 L R U 50, 50 0, -10 D -10, 0 0,0
Hi this is from a textbook. Thank you. Consider the following game in which Sally can play T or B and John chooses between L or R. Each player makes their choice simultaneously. If Sally chooses T and John chooses L, Sally gets a payoff of 5 and John has a payoff of 4. If Sally plays T and John R, Sally’s payoff is 8 and John gets 3. If Sally Chooses B and John L, the payoffs are 3 to Sally and 2 to John. Finally, if Sally chooses B and John R, the payoffs are 7 to Sally and 0 to John. Which statement is true? a) The Nash equilibrium is (B,R); this is a prisoners’ dilemma b) The Nash equilibrium is (T,R); this is a prisoners’ dilemma c) The Nash equilibrium is (T,R); this is not dominant strategy equilibrium d) The Nash equilibrium is (T,L); this is a dominant strategy equilibrium e) None of the above