Question

In: Economics

Suppose two players play the following prisoner's dilemma for 10 periods (periods 1 through 10). C...

Suppose two players play the following prisoner's dilemma for 10 periods (periods 1 through 10).

C D
C 3,3 -1,4
D 4,-1 0,0

Suppose that players simultaneously choose their strategy before the repeated game, and can't change it once the repeated game has started. Players can choose one of the three following strategies as defined in class:

• Always Defect

• Grim-Trigger

• Tit-For-Tat

(a) Draw the 3×3 matrix game with the payoffs for each strategy pair calculated over the 10 periods. (Each row and each column represent one of the three strategies)

(b) What are the pure-strategy Nash equilibria of game in part (a)?

(c) Now suppose now that player 1 make a mistake in period 2. That is if his strategy is supposed to play C then he accidentally plays D, and if his strategy is supposed to play D then he accidentally plays C. Draw the 3×3 matrix game with the payoffs for each strategy pair calculated over the 10 periods.

(d) What are the pure-strategy Nash equilibria of game in part (c)?

(e) Now consider the new strategy called Win-Stay, Lose Shift (WSLS):

• Start with C • If the other person plays C, then I repeat MY last action

• If the other person plays D, then I switch MY last action

What sequence of actions is played if both players play WSLS against each other, and player 1 makes a mistake in period 2. What are the payoffs for each player?

(f) Is this better than when both players play TFT against each other, and player 1 makes a mistake in period 2?

Solutions

Expert Solution

There are three strategies possible:

(i) always defect: you always chose not to cooperate. i.e. both players always play D.

(ii) grim trigger: you start by cooperating and continue to cooperate as long as everyone has cooperated in the past. If someone has defected, then you defect forever.

(iii) tit fot tat: you follow a course of action consistent with your opponent's previous turn.

(a)

Player 2
always defect grim trigger tit for tat
Player 1 Always defect 0,0 3,-1 3/2 , -1/2[1]
grim trigger -1,3 20,20[2] 11,11[3]
tit for tat -1/2, 3/2 11,11 10, 10[4]

Pure strategy nash equilibria are (always defect, always defect), (grim trigger, grim trigger).

[1] There are two possible situations:

Player 2 starts with C or Player 2 starts with D

In the first case, the outcome is D1C1, D2D2, D3,D3.....D10,D10

Payoff of player 1 = 3 + 0*9 = 3, Payoff of player 2 = -1 + 0*9 = -1

In the second case, the outcome is D1D1, D2D2, D3,D3.....D10,D10

Payoff of player 1 = 0*10 = 0, Payoff of player 2 = 0*10 = 0

Both cases can occur with equal probability 1/2.

Expected outcome of player 1 =

Expected outcome of player 2 =

[2] Each player starts with C. Since no one defects, outcome is C1C1, C2C2, .....C10C10

Payoff of each player = 2*10 = 20

[3] There are two possible situations:

Player 2 starts with C or Player 2 starts with D

In the first case, the outcome is C1C1, C2C2,.....C10C10

Payoff of each player = 2*10 = 20

In the second case, the outcome is C1D1, D2C2, D3D3.....D10D10

Payoff of player 1 = -1 + 3 + 0*8 = 2, Payoff of player 2 = 3+ (-1) + 0*8 = 2

Both cases can occur again with equal probability 1/2.

[4] There are four possible cases:

C1C1, C2C2,.....C10C10

C1D1, D2C2, C3D3.....C10D10

D1C1, C2D2, D3C3.....D10C10

D1D1, D2D2, D3,D3.....D10,D10

(c)

Player 2
always defect grim trigger tit for tat
Player 1 Always defect -10,30 20,20 37/2, 41/2
grim trigger -9,27 -5, 23 16,18
tit for tat -19/2, 57/2 -13/2, 45/2 10,10

Nash equilibrium is (grim trigger, always defect)


Related Solutions

A prisoner's dilemma is a game that involves no dominant strategies. a game in which players...
A prisoner's dilemma is a game that involves no dominant strategies. a game in which players should work together towards the Nash Equilibrium. a game where if players act in rational and self-interested ways everyone will be worse off than a cooperative outcome. a game in which players collude to outfox authorities.
I am using C++ Write a program that allows two players to play a game of...
I am using C++ Write a program that allows two players to play a game of tic-tac-toe. Use a two-dimensional char array with three rows and three columns as the game board. Each element of the array should be initialized with an asterisk (*). The program should run a loop that does the following: Displays the contents of the board array. Allows player 1 to select a location on the board for an X. The program should ask the user...
1) Explain why oil producing countries have been caught in a prisoner's dilemma situation?
1) Explain why oil producing countries have been caught in a prisoner's dilemma situation?
Suppose two players play a traditional Russian Roulettes game. One bullet is put into a 6-revolver...
Suppose two players play a traditional Russian Roulettes game. One bullet is put into a 6-revolver and the barrel is randomly spun so that there is equal chance for each chamber to be under the hammer. Two players take turns to pull the trigger against themselves until one kills him or herself. Under such rules, would you rather go first or second? What’s the probability of survival to go first? b) Now the rule is changed, the barrel gets spun...
Two players A and B play a game of dice . They roll a pair of...
Two players A and B play a game of dice . They roll a pair of dice alternately . The player who rolls 7 first wins . If A starts then find the probability of B winning the game ?
Suppose that two players are playing the following game. Player 1 can choose either Top or...
Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table: player 2: left right   player 1 : Top: (1,2) (2,4) bottom: (3,4) (0,3) where the number on the left is the payoff to Player 1, and the number on the right is the payoff to Player 2. A) (2 points) Does Player 1 have a dominant...
Suppose that two players are playing the following game. Player 1 can choose either Top or...
Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table    Player 2 Player 1 Left Right Top 6 5 9 4 Bottom 7 4 5 3 where the number on the left is the payoff to Player A, and the number on the right is the payoff to Player B. A) (4 points) Does player...
Two players play a rock-paper-scissors game. The losing player will give $1 to the winning player....
Two players play a rock-paper-scissors game. The losing player will give $1 to the winning player. If it is a draw, no payment is made. The payoff to a player is the amount of money (s)he gets. Represent the situation in a matrix form. Find all the Nash equilibria.
1. Suppose oil is only to be extracted over two periods (period 0 and period 1)...
1. Suppose oil is only to be extracted over two periods (period 0 and period 1) . T he inverse demand for oil is estimated to be p = 300 - q , where p is the price of oil and q is the quantity demanded. The marginal cost of extraction is given by MC = q . These relations do not change from period to period. Assume a discount rate of r = 0.05. Suppose the initial stock of...
Design and implement a Python program which will allow two players to play the game of...
Design and implement a Python program which will allow two players to play the game of Tic-Tac-Toe in a 4x4 grid! X | O | X | O -------------- O | O | X | O -------------- X | X | O | X -------------- X | X | O | X The rules for this game is the same as the classic, 3x3, game – Each cell can hold one of the following three strings: "X", "O", or "...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT