Question: ( 1 4 points ) Consider the infinitely repeated game in which the stage game is shown here. Each players payoff is the present value
points Consider the infinitely repeated game in which the stage game is shown here. Each players payoff is the present value of her payoff stream, where the discount factor is Also assume that the two players share the same discount factor of future payoffs.
tableAPlayer ABCBtablePlayer C
a point Find every purestrategy Nash equilibrium of the stage game.
b point If Player chooses what is the best response of Player
c point If Player chooses B what is the best response of Player points Consider the following punishment mechanism:
Each player will choose in stage and in any later stages as long as A was chosen by both players in all past stages.
If a player chooses any strategy other than in one stage, the opponent will chooses B in all later stages.
For what range of does this punishment mechanism support to be played in every stage?
Hint: You can start by using your answers in parts b and c to figure out these two things: If Player defects in a stage by choosing something other than A what specific strategy would she choose? For this defecting player, what would be her resulting payoff stream in later stages?
d point If Player chooses C what is the best response of Player
e points Consider an alternative punishment mechanism as follows:
Each player will choose C in stage and in any later stages as long as C was chosen by both players in all past stages.
If a player chooses any strategy other than C in one stage, the opponent will chooses B in all later stages.
For what range of does this punishment mechanism support to be played in every stage? Hint: You can start by using your answers in parts b and e to figure out these two things: If Player defects in a stage by choosing something other than what specific strategy would she choose? For this defecting player, what would be her resulting payoff stream in later stages?
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
