Consider the Sequential Matching Pennies Game. Now assume player 1 is allowed to quit the game in the initial node, hence she has three actions. If she quits the game, the game ends and both players receive O payoff. If she chooses Head or Tail, the game is played as illustrated in the lecture. Which of the following is TRUE for this game? The set of pure strategy Nash equilibria and the set of subgame perfect equilibria are identical OB. There are pure strategy Nash equilibrium which are not subgame perfect equilibrium OC. There are subgame perfect equilibrium which are not Nash equilibrium

Consider the Sequential Matching Pennies Game. Now assume player 1 is allowed to quit the game in the initial node, hence she has three actions. If she quits the game, the game ends and both players receive O payoff. If she chooses Head or Tail, the game is played as illustrated in the lecture. Which of the following is TRUE for this game? The set of pure strategy Nash equilibria and the set of subgame perfect equilibria are identical OB. There are pure strategy Nash equilibrium which are not subgame perfect equilibrium OC. There are subgame perfect equilibrium which are not Nash equilibrium

Principles of Economics (MindTap Course List)

8th Edition

ISBN:9781305585126

Author:N. Gregory Mankiw

Publisher:N. Gregory Mankiw

Chapter17: Oligopoly

Section: Chapter Questions

Problem 5CQQ

See similar textbooks

Similar questions

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 the payoff matrix for a game depicted below. Player 1 selects the row and Player 2 selects the column. Up Down Left 1, -1 -1, 1 Right -1, 1 1, -1 What is (are) the Nash equilibrium (equilibria)? Question 18Answer a. Player 1 plays right; Player 2 plays down b. Player 1 plays left; Player 2 plays down c. Player 1 plays down; Player 2 plays left d. Player 1 plays right; Player 2 plays up e. Player 1 plays up; Player 2 plays left f. There is no Nash equilibrium g. Player 1 plays down; Player 2 plays right h. Player 1 plays up; Player 2 plays right i. Player 1 plays left; Player 2 plays up
answer the ff: Suppose that each company cancharge either a high price for tickets or a low price. Ifone company charges $300, it earns low profit if theother company also charges $300 and high profit ifthe other company charges $600. On the other hand,if the company charges $600, it earns very low profit ifthe other company charges $300 and medium profitif the other company also charges $600.a. Draw the decision box for this game.b. What is the Nash equilibrium in this game?Explain.c. Is there an outcome that would be better than theNash equilibrium for both airlines? How could itbe achieved? Who would lose if it were achieved?
Consider Bernard \ Mary Left Center Right Top 0,5 1,0 2,2 Bottom 1,0 0,3 2,2 The first number in a cell denotes the payoff to Bernard and the second number denotes the payoff to MaryForexample: πB(B,L)=1and πM(T,L)=5. a Give all pure strategy Nash equilibria of this one-shot game, if any. Briefly explain.Let Bernard play Top with probability p and Bottom with probability 1 − p; let Mary play Left with probability qL , Center with probability qC and Right with probability qR = 1 − qL − qC . b Give all mixed strategy Nash equilibria of this game.
1. Ten commuters must decide simultaneously in the morning to use route A or route B to go from home (same place for all) to work (ditto). If a of them use route A, each of them will travel for 10a + 40 minutes; if b of them use route B, each of them will travel for 10b minutes. Everyone wishes to minimize his/her commuting time. a) Describe the pure Nash equilibrium (or Nash equilibria) of this ten-person game. Compute the corresponding profile of commuting times. Explicitly list all equilibrium conditions that are satisfied.
Please no written by hand Two players bargain over how to split $10. Each player i ∈ {1, 2} choose a number si ∈ [0, 10] (which does not need to be an integer). Each player’s payoff is the money he receives. We consider two allocation rules. In each case, if s1 + s2 ≤ 10, each player gets his chosen amount si and the rest is destroyed. 1. In the first case, if s1 + s2 > 10, both players get zero. What are the (pure strategy) Nash equilibria? 2. In the second case, if s1 + s2 > 10 and s1 6= s2, the player who chose the smallest amount receives this amount and the other gets the rest. If s1 + s2 > 10 and s1 = s2, they both get $5. What are the (pure strategy) Nash equilibria? 3. Now suppose that s1 and s2 must be integers. Does this change the (pure strategy) Nash equilibria in either case?