Answered: Consider a dynamic game of complete and…

Consider a dynamic game of complete and perfect information. Suppose there are now simultaneous moves in each stage. How does this change the description of the game?

Microeconomics: Principles & Policy

14th Edition

ISBN:9781337794992

Author:William J. Baumol, Alan S. Blinder, John L. Solow

Publisher:William J. Baumol, Alan S. Blinder, John L. Solow

Chapter13: Between Competition And Monopoly

Section: Chapter Questions

Problem 10DQ

See similar textbooks

Similar questions

Look at the attached table. A. What are the Nash equilibrium to this game (if there are any)? B. Are any of the Nash equilibrium efficient? If yes, which one(s)? If any are inefficient, explain why.
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.
a. How many proper subgames does this dynamic game have? Explain briefly. b. Is it a game of perfect or imperfect information? Explain briefly. c. What is the subgame-perfect equilibrium of this game? Show that it is unique.
1. With nash equilibrium, do you always choose the optimal strategy? 2. Can a game have more than one nash equilibrium?
a. Draw a game tree that represents this game. How many proper sub- games does it have? b. Are there other game trees that would work? Explain briefly. c. Construct the matrix representation of the normal form of this dynamic game.
i. ii. QUESTION ONE A. A Nash equilibrium is a strategy profile such that every player's strategy is the best response to all the other players. It requires that each player makes a best response and that expectations regarding the play of other players are correct. Below is the table showing strategies and payoff for Player 1 and Player 2. PLAYER 1 R1 R2 R3 R4 C1 0,7 5,2 7,0 6,6 C2 2,5 3,3 2,5 2,2 PLAYER 2 C3 7,0 5,2 0,7 4,4 CA 6,6 2,2 4,4 10,4 REQUIRED; Transform the normal form game above into an imperfect extensive game form Find the Nash equilibrium for the game above using iterative deletion of strictly dominated strategies. Find the Nash equilibrium using brute force or cell by cell inspection.
1. A game may have more than one Nash equilibrium. T/F ? 2. A game has always at least one pure strategy Nash equilibrium. T/F? 3. A situation where everyone is playing a dominant strategy must be a Nash equilibrium. T/F?
9. Little Kona is a small coffee company that is consider- ing entering a market dominated by Big Brew. Each company's profit depends on whether Little Kona enters and whether Big Brew sets a high price or a low price: Little Kona Enter Don't Enter High Price Kona makes $2 million Kona makes zero Big Brew Brew makes $3 million Brew makes $7 million Kona loses $1 million Low Price Kona makes zero Brew makes $1 million Brew makes $2 million
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
1. Each of two players simultaneously announces either Rock, Paper, or Scissors. Paper beats Rock, Rock beats Scissors, and Scissors beats Paper. The player who names the winning object receives $1 from her opponent. If both players make the same choice, no payment is made. Each players's preferences are represented by by the expected amount of money she receives. a) Formulate the situation as a strategic game and find all its mixed strategy equilibria. Make sure that you consider all different supports. b) Find all the mixed strategy equilibria of the modified game in which player 2 is prohibited from announcing Rock.
Answer all the questions, show all the working. Consider the following game in normal form. Not cooperate Cooperate Not cooperate 20,20 50,0 Cooperate 0,50 40,40 What is Nash equilibrium? Is it efficient? Why? What needs to be complied with so that the players would like to cooperate? What happens when one of the players does not cooperate? Why? Define trigger strategy. Calculate the discount factor (δ) that would make both players decide to cooperate.
5. Aaron and Betty play the following one-shot game. Aaron Up Middle Down Left 10,0 5,10 1,1 Betty Right 0,5 1,0 2,2 a. Does the game above have any (pure strategy) Nash equilibria? Find any equilibria or explain why an equilibrium doesn't exist. b. Suppose instead that Aaron moves first and Betty moves second. Represent this situation with a game tree and find the subgame perfect Nash equilibrium. Are Aaron and Betty better off playing a simultaneous game or a sequential game in which Aaron moves first? Explain. c.