Consider the following sequential-move game, where the first value specified in the end nodes is the payoff for Player A, the second value is the payoff for Player B and the third value is the payoff for Player C. Determine its subgame perfect equilibrium. Identify the equilibrium outcome and describe carefully the strategy used by each player in equilibrium (remember, a strategy for a player is a complete specification of what action to take in every possible contingency). N AD n1 S B n₂ C تی u d -1, 4, -2 AND n4 S 0,-1, 3 A ng 3, -2, 10 1,0, 3 N S -4, 6, -1 1, 3, 3

Consider the following sequential-move game, where the first value specified in the end nodes is the payoff for Player A, the second value is the payoff for Player B and the third value is the payoff for Player C. Determine its subgame perfect equilibrium. Identify the equilibrium outcome and describe carefully the strategy used by each player in equilibrium (remember, a strategy for a player is a complete specification of what action to take in every possible contingency). N AD n1 S B n₂ C تی u d -1, 4, -2 AND n4 S 0,-1, 3 A ng 3, -2, 10 1,0, 3 N S -4, 6, -1 1, 3, 3

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

Up ооооо Down Player 1 Up No EFFICIENT equilibrium exists Down Up Down Player 2 P1 gets $120 P2 gets $5 P1 gets $100 P2 gets $10 P1 gets $95 P2 gets $95 In the game above, what is/are the EFFICIENT sub-game perfect Nash equilibrium? (up,up) (up,down) (down, up) (down, down) P1 gets $15 P2 gets $25
2. Consider the two-by-two bimatrix game listed below: Left Right (2,-2) (1,-1) Up Down (3,-3) (-1,1) where the player "Row" chooses the action "up" or "down" and the player "Column" chooses the action "left" or "right". Describe a mixed strategy Nash Equilibrium for this game.
Consider the following sequential move game of imperfect information. Consider the following sequential move game of imperfect information. In the event that Otis chooses Down, then they play the simultaneous move game shown in normal form (where Otis chooses between X and Y and Maeve simultaneously chooses between W and V). A (25,6) Maeve Up B (5,10) (12,5) Otis Middle Maeve Down w Otis (0, 0) (10, 10) Y (15, 15) (0, 0) Find all (pure strategy) subgame perfect Nash equilibria.
Show that there does not exist a pure-strategy perfect Bayesian equilibrium in the following extensive-form game. What is the mixed- strategy perfect Bayesian equilibrium? R Player 1 M L Player 2 3
Describe the game and find all Nash equilibria in the following situation: Each of two players chooses a non-negative number. In the choice (a1, a2), the payoff of the first player is equal to a1(a2 - a1), and the payoff of the second player is equal to a2(1 – a1 – a2).
3. The following is an interpretation of the rivalry between the United States (USA) and the Soviet Ünion (USSR) during the cold war. Each side has the choice of two strategies: Aggressive and Restrained. The payoff table is given as follows: USSR Restrained Aggressiveness Restrained 4,3 1,4 USA Aggressiveness 3,1 2,2 a) Consider this game when the two countries move simultaneously. Find all pure strategy Nash equilibria. b) Next consider three alternative ways in which the game could be played with sequential moves: (i) The USA moves first and the USSR moves second. (i) the USSR moves first and the USA moves second. (i) The USSR moves first, and the USA moves second, but the USSR has a further move after the USA moves. For each case, draw the game tree and find the subgame-perfect Nash equilibrium. c) What are the key strategic issues (commitment, credibility and so on) for the two countries. (Note: Be concise. Your answer should not exceed 300 words].
!
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 N-player game. Each agent has a choice of strategy A or B. The state variable is x, the proportion of agents choosing strategy A. For every agent, the utility of choosing strategy A is U(A) = 10 +2x and the utility of choosing strategy B is U(B) = 10+3x. What is the Nash equilibrium to this game? Explain.
Consider the following 2-player normal form game. Player 2 Bananas Orange Player 1 Grapes 11, 3 8, 2 Apple 9, 7 6, 5 Player 1's dominant strategy is [Select ] and Player 2's dominant strategy is [ Select ) The Nash Equilibrium of this game is ( Select ) (select all that apply).
See the extensive form game in the image attached (the payoffs of player 1 are written on top and the payoffs of player 2 are on the bottom). a) Write this game in normal form (a player's strategy is a complete contingent plan that tells them what to play at each of their information sets) (b) Find all the Nash equilibria of the normal form game from part (a)
Problem 2. Consider the partnership-game we discussed in Lecture 3 (pages 81-87 of the textbook). Now change the setup of the game so that player 1 chooses x = [0, 4], and after observing the choice of x, player 2 chooses y ≤ [0, 4]. The payoffs are the same as before. (a) Find all SPNE (subgame perfect Nash equilibria) in pure strategies. (b) Can you find a Nash equilibrium, with player 1 choosing x = 1, that is not subgame perfect? Explain.