1. Consider the following sequential game:Left(3,5)MaryGo(6,4)UpRightJohnStop(5.7)John(a) Draw the game tree of the game.JohnGoDown(4,1)LeftMaryStop(2,5)Right(6,-1)(John as player 1 and Mary as player 2)By backward induction, find a Nash equilibrium and the corresponding payoffs.2. Eve and Noa start with $10 in each of their piles. They take turns choosing oneof two actions, continue or stop, with Eve choosing first. Each time a player sayscontinue, $10 will be removed from her pile, and $20 will be added to the otherplayer's pile. The game automatically stops when the total amount in their pilesreaches $60.(Eve as player 1 and Noa as player 2)(b) By backward induction, find a Nash equilibrium and the corresponding payoffs.

Nash equilibrium is a concept in game theory that describes a stable state of a strategic…

1. Consider the following sequential game: Left (3,5) Mary Go (6,4) Up Right John Stop (5.7) John John Go Down (4.1) Left Mary Stop (2.5) Right (6,-1) (John as player 1 and Mary as player 2) By backward induction, find a Nash equilibrium and the corresponding payoffs.

1. Consider the following sequential game: Left (3,5) Mary Go (6,4) Up Right John Stop (5.7) John John Go Down (4.1) Left Mary Stop (2.5) Right (6,-1) (John as player 1 and Mary as player 2) By backward induction, find a Nash equilibrium and the corresponding payoffs.

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 the game with the payoffs below. Which of the possible outcomes are MORE efficient than the Nash Equilibrium (NE)? Note, they do NOT need to be Nash equilibria themselves, they just need to be more efficient than the NE. Multiple answers are possible, but not necessary. You need to check ALL correct answers for full credit. JILL High Medium LowMAGGIE Left 3,4 2,3 2,2Center 4,8 9,7 8,7Right 7,6 8,5 9,4Group of answer choices (Left, Low) There is no strategy combination that is more efficient than the Nash equilibrium for this game. (Right, Medium) (Left, High) (Center, Medium) (Center, High) (Center, Low) (Left, Medium) (Right, Low) (Right, High)
Two rival companies competing in the same market need to decide their plans for future expansion of their stores. The Table below shows the possible outcomes of their mutually interdependent actions (payoffs are profits in £m) Giga Company Titanic Conglomerate No Change Refurbishment of existing stores Large Expansion No Change 30, 40 25, 35 15, 24 Refurbishment of existing stores 35, 30 28, 32 18, 33 Large Expansion 12, 22 18, 20 20, 25 The Nash equilibrium: (A) does not exist. (B) occurs when both firms choose Refurbishment of existing stores. (C) occurs when both firms choose Large Expansion. (D) occurs when both firms choose No Change.
Can you help me with the question below? What is [are] the Nash Equilibrium [Equilibria] of this game? A) (10;10) and (20;20) B) (30;30) C) (10;20) and (20;10) D) (20;20) E) (30;30)
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.
2. For the following payoff matrix find all of the mixed strategy Nash equilibria (check for dominated strategies to eliminate). Player 1 X Y Z A 1,3 4,1 2,3 Player 2 B 2,4 3,1 0,0 C 2,3 5,0 4,2
Player 2 Left Right P1: $4 Player 1 Up P2: $1 P1: $10 Down P2:s10 Which of the Nash Equilibrium to this game are efficient? [Check all that apply] A) (up, left) B) (down, left) C None are efficient (D) (up right) E (down, right) Last saved 4:31:15 PM P1:S1 P2: $6 P1: $0 P2: $11 Grading
(The Beckhams' dilemma) Victoria and David are husband and wife. They both prefer ciean to dirty house but neither likes to clean the house. Their payoffs are given in the table below. Victoria Clean Don't clean 0,8 Clean 5,5 David Don't clean 8,0 1,1 a) Let say they play the clean house game only once, what is the Nash equilibrium? b) Let say Victoria and David has to decide whether to clean or not every day for indefinite number of days. How grim-trigger strategy will be our subgame perfect Nash equilibrium? In other words, what is the patience rate that ensure Victoria and David maintain the cleanliness of the house?
Consider the following sequential game: 1 O D,L U.L U,R U D,R D (0,2) 2 L What is the subgame perfect Nash equilibrium of this game? R. (-1,-1) (1,1)
Solve parts 1(d) and 1(e) ONLY