The payoff matrix below shows the payoffs for Firm A and Firm B, each of whomcan either "cooperate" or "cheat." The numbers in parentheses are (payoff for A,payoff for B).Firm BCooperateCooperate (30, 30)(x, 10)Cheat(10, X)(20, 20)Firm AChentIf x = 40, the Nash equilibrium is.O a. (Firm A: cheat, Firm B: cheat)O b. (Firm A: cooperate, Firm B: cheat)O c. (Firm A: cheat, Firm B: cooperate)O d. (Firm A: cooperate, Firm B: cooperate)O e. There is no Nash equilibrium for this value of x.

The Nash equilibrium, named after the mathematician John Forbes Nash Jr., is the most systematic…

The payoff matrix below shows the payoffs for Firm A and Firm B, each of whom can either "cooperate" or "cheat." The numbers in parentheses are (payoff for A, payoff for B). Firm B Cooperate Cooperate 30, 30) Chent Cheat (10, X) (20, 20) Firm A (x, 10) If x = 40, the Nash equilibrium is.. O a. (Firm A: cheat, Firm B: cheat) O b. (Firm A: cooperate, Firm B: cheat) Oc. (Firm A: cheat, Firm B: cooperate) O d. (Firm A: cooperate, Firm B: cooperate) O e. There is no Nash equilibrium for this value of x.

The payoff matrix below shows the payoffs for Firm A and Firm B, each of whom can either "cooperate" or "cheat." The numbers in parentheses are (payoff for A, payoff for B). Firm B Cooperate Cooperate 30, 30) Chent Cheat (10, X) (20, 20) Firm A (x, 10) If x = 40, the Nash equilibrium is.. O a. (Firm A: cheat, Firm B: cheat) O b. (Firm A: cooperate, Firm B: cheat) Oc. (Firm A: cheat, Firm B: cooperate) O d. (Firm A: cooperate, Firm B: cooperate) O e. There is no Nash equilibrium for this value of x.

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 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)?
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?
20) Given the payoff matrix in the figure, the Nash equilibrium outcome of this game is for: Ajinomoto Produce 30 Produce 40 million pounds million pounds Ajinomoto makes $180 million Ajinomoto makes $200 million Produce 30 million ADM makes $180 million ADM makes $150 million pounds Ajinomoto makes $150 million Ajinomoto makes $160 million Produce 40 million ADM makes $200 million ADM makes $160 million pounds O A. each firm to produce 30 million pounds. B. each firm to produce 40 million pounds. C. ADM to produce 30 million pounds and for Ajinomoto to produce 40 million pounds. D. ADM to produce 40 million pounds and for Ajinomoto to produce 30 million pounds. ADM
2. Provide the normal-form expression to the extensive-form game below, and find all pure-strategy Nash equilibria there. Find the subgame-perfect Nash equilibrium then. A B X E Y B A B F t G F G BF B D A 0 3. Find the subgame perfect Nash equilibria (may or may not be unique) in the game below. A B 100 30 F 60 9 5 B 3 5 12 10 60 10 80 10 180 60 200 40
rock paper scissors гock 0. -3 1 рарer 1. -1 scissors -1 3 0. (a) Show that xT= ( ) and yT= (3) together are not a Nash equilibrium 3 3 313 for this modified game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
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.
1. Consider the two-player game L R T 2,7 0,0 B 2,0 3,1 (a) Find the set of (pure and mixed) Nash equilibria. (b) Which of the Nash equilibria, if any, are weakly undominated? (c) Which of the Nash equilibria, if any, are perfect, proper, essential?
Suppose now we alter the game so that whenever Colin chooses "paper" the loser pays the winner 3 instead of 1: rock paper scissors rock 0. -3 1 1. раper scissors -1 -1 3 (a) Show that xT= (,) and yT= (5) together are not a Nash equilibrium 3'31 for this modified 3'3 game. (b) Formulate a linear program that can be used to calculate a mixed strategy x € A(R) that maximises Rosemary's security level for this modified game. (c) Solve your linear program using the 2-phase simplex algorithm. You should use the format given in lectures. Give a mixed strategy x E A(R) that has an optimal security level for Rosemary and a mixed strategy y E A(C) that has an optimal security level for Colin.
Three retail chains are each deciding whether to locate a store in town A or town B. The profit or payoff that a chain receives depends on the town selected and the number of other chains that put stores in that town; see accompanying table. (given) a. Find a symmetric mixed-strategy Nash equilibrium in which chainsrandomize.b. Find all mixed-strategy Nash equilibria in which one of the chains putsa store in town A for sure.c. Find all mixed-strategy Nash equilibria in which one of the chains putsa store in town B for sure.
Which one of following statements is false? * Consider the following game. B D E F There are 7 subgames in this extensive-form game. There are 6 proper subgames in this extensive-form game. (BK, CE) is a Subgame Perfect Nash Equilibrium. O (BK, DE) is a Subgame Perfect Nash Equilibrium. G H I J K L M N 3,4 4,3 1,2 -5,7 6,5 2,8 9,1 3,6
Problem 3. Consider the following game with three firms. First, firms 1 and 2 si- multancously choose quantities q1 and q2 respectively. After observing firm 1 and 2's quantities, firm 3 chooses its quantity q3. There is no production cost and the inverse demand function is p= 12 – (91 +2 + 93). (a) Compute the SPNE of this game. (b) Give an example of Nash equilibrium s* with s = 4 and s, = 6 , that is not subgame perfect. game theory question
The payoff matrix below describes a one-shot game in which two farmers ("Player A" and "Player B") choose between planting corn or planting wheat. The payoffs in this matrix represent thousands of dollars of income, so more is better. Pla yer A Plant Corn Plant Wheat What kind of equilibrium is this? Plant Corn Dominant Strategy Equilibrium Nash equilibrium 3, 3 Player B 5,0 Both a Nash and a Dominant Strategy Equilibrium O No equilibrium Plant Wheat 0,5 1, 1