Nash equilibria

ENGR.ECONOMIC ANALYSIS
14th Edition
ISBN:9780190931919
Author:NEWNAN
Publisher:NEWNAN
Chapter1: Making Economics Decisions
Section: Chapter Questions
Problem 1QTC
icon
Related questions
Question

PART C D

(d) Now, consider the dynamic setup once again where player 1 moves before
player 2, and the payoffs remain unchanged (a = 0).
i
Draw the game tree for this dynamic game. What are the
possible strategies for each player? Recall that a strategy profile for a
player not at the initial node of the game tree must specify an action
for the player at every node.
ii.
Find the backward-induction solution(s) to this game.
Calculate the equilibrium payoffs for each player. Com-
pared to the simultaneous game, is there a first-mover advantage or
a second-mover advantage? How is this different to the result in the
ii.
previous dynamic game when a= 2?
Transcribed Image Text:(d) Now, consider the dynamic setup once again where player 1 moves before player 2, and the payoffs remain unchanged (a = 0). i Draw the game tree for this dynamic game. What are the possible strategies for each player? Recall that a strategy profile for a player not at the initial node of the game tree must specify an action for the player at every node. ii. Find the backward-induction solution(s) to this game. Calculate the equilibrium payoffs for each player. Com- pared to the simultaneous game, is there a first-mover advantage or a second-mover advantage? How is this different to the result in the ii. previous dynamic game when a= 2?
1. Static and Dynamic Game.
Consider the following 2-by-2 game:
C
D
1A (1,10) (1,1)
B (2, a) (0,1)
(a)
erwise, find the pure-strategy Nash equilibria, if any of this game. (There
is no need to look for equilibria in mixed strategies)
Assume for now that a = 2. Using dominant strategies or oth-
(b) Now, consider the dynamic game in which player 1 moves before player 2,
and the payoffs remain unchanged.
i.:
possible strategies for each player? Recall that a strategy profile for a
player not at the initial node of the game tree must specify an action
for the player at every node.
Draw the game tree for this dynamic game. What are the
ii
"Find the backward-induction solution(s) to this game.
Calculate the equilibrium payoffs for each player. Com-
pared to the simultaneous game, is there a first-mover advantage or a
ii.
second-mover advantage?
(c) Now, assume that a = 0 in the original static game.
i.
Find all the Nash equilibria in pure and mixed strategies.
Denoting p the probability player 1 plays A and q the prob-
ability that player 2 plays C, compute and graph the best-response
functions of each player. Show that where the two best response func-
tions intersect represent the Nash equilibrium or equilibria of the game.
Calculate the equilibrium payoff of each player.
ii.
iii.
Transcribed Image Text:1. Static and Dynamic Game. Consider the following 2-by-2 game: C D 1A (1,10) (1,1) B (2, a) (0,1) (a) erwise, find the pure-strategy Nash equilibria, if any of this game. (There is no need to look for equilibria in mixed strategies) Assume for now that a = 2. Using dominant strategies or oth- (b) Now, consider the dynamic game in which player 1 moves before player 2, and the payoffs remain unchanged. i.: possible strategies for each player? Recall that a strategy profile for a player not at the initial node of the game tree must specify an action for the player at every node. Draw the game tree for this dynamic game. What are the ii "Find the backward-induction solution(s) to this game. Calculate the equilibrium payoffs for each player. Com- pared to the simultaneous game, is there a first-mover advantage or a ii. second-mover advantage? (c) Now, assume that a = 0 in the original static game. i. Find all the Nash equilibria in pure and mixed strategies. Denoting p the probability player 1 plays A and q the prob- ability that player 2 plays C, compute and graph the best-response functions of each player. Show that where the two best response func- tions intersect represent the Nash equilibrium or equilibria of the game. Calculate the equilibrium payoff of each player. ii. iii.
Expert Solution
steps

Step by step

Solved in 8 steps with 67 images

Blurred answer
Knowledge Booster
Multiple Equilibria
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, economics and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
ENGR.ECONOMIC ANALYSIS
ENGR.ECONOMIC ANALYSIS
Economics
ISBN:
9780190931919
Author:
NEWNAN
Publisher:
Oxford University Press
Principles of Economics (12th Edition)
Principles of Economics (12th Edition)
Economics
ISBN:
9780134078779
Author:
Karl E. Case, Ray C. Fair, Sharon E. Oster
Publisher:
PEARSON
Engineering Economy (17th Edition)
Engineering Economy (17th Edition)
Economics
ISBN:
9780134870069
Author:
William G. Sullivan, Elin M. Wicks, C. Patrick Koelling
Publisher:
PEARSON
Principles of Economics (MindTap Course List)
Principles of Economics (MindTap Course List)
Economics
ISBN:
9781305585126
Author:
N. Gregory Mankiw
Publisher:
Cengage Learning
Managerial Economics: A Problem Solving Approach
Managerial Economics: A Problem Solving Approach
Economics
ISBN:
9781337106665
Author:
Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor
Publisher:
Cengage Learning
Managerial Economics & Business Strategy (Mcgraw-…
Managerial Economics & Business Strategy (Mcgraw-…
Economics
ISBN:
9781259290619
Author:
Michael Baye, Jeff Prince
Publisher:
McGraw-Hill Education