Why Choose Us?
0% AI Guarantee
Human-written only.
24/7 Support
Anytime, anywhere.
Plagiarism Free
100% Original.
Expert Tutors
Masters & PhDs.
100% Confidential
Your privacy matters.
On-Time Delivery
Never miss a deadline.
4
4. Consider the prisoners' dilemma discussed in the clips, Player 2 ? D ? 5,5 0,10 Player I D 10,0 2,2 (a) Suppose the stage game above is repeated infinitely many times. Is there any SPNE in which players play (C,D) in period 0 and in every even-numbered period, and (D,C) in period 1 and in every odd-numbered period? If yes, find it and argue it is an equilibrium. If not, explain why not.
Expert Solution
When t = 2n for n = 0,1,2,...
Both players will choose to play (C,D) therefore payoff for each player in even period will be 0 for player 1 and 10 for player 2.
Similarly,
Both players will choose to play (D,C) therefore payoff for each player in odd period will be 10 for player 1 and 0 for player 2.
Now we have SPNE if both players collude is (C,C) = (5,5) hence in this case both players will choose to play (C,C) infinitely.
We need to show that if Present value of payoff from strategy given in the question is greater than present value of SPNE with (C,C).
Present value of payoff from the strategy given in the question for player 1 & d is the discount rate where 0<d<1; we use to find present value of future payoffs.
0+10d+0+10d^3+0+10d^5+... = 10d(1+d^2+d^4+d^6+...) = 10d/(1-d^2)
Present value of payoff from the strategy (C,C) for player 1.
5+5d+5d^2+5d^3+.... = 5/(1-d)
thern if we can find any value "d" which is valid one then we can firmly say that strategy given in the question is an SPNE.
Therefore, we should have
10d/(1-d^2) >= 5/(1-d)
10d/(1+d) >= 5
10d >= 5+5d
5d >= 5
d >= 1
therefore this can be SPNE iff d= 1. This means that when both players are patient enough about the future payoffs then this can be SPNE else for any feasible value of 0<d<1 we don't have this strategy as SPNE.
Archived Solution
You have full access to this solution. To save a copy with all formatting and attachments, use the button below.
For ready-to-submit work, please order a fresh solution below.





