Question

In: Economics

Consider the following game. Ann chooses rows, and Bob chooses columns. [12 marks] LMR 3 4...

Consider the following game. Ann chooses rows, and Bob chooses columns.

[12 marks]

LMR

3 4

2 0

1 3

3 2

4 4

4 0

0 2

1 1

0 1

U

C

D

(a) Find all pure strategy Nash Equilibria.

(b) Find the set of Rationalizable strategies for each player. Find a dominating strategy for each deletion.

(c) Is there a Nash equilibrium in which Bob puts strictly positive probability on L and M but none on R? If so find it; if not explain why not. (Explanation should be 3 sentances or fewer.)

(d) Is there a mixed strategy Nash equlibrium in which Bob puts strictly positive prob- ability on L and R but none on M? If so find it; If not explain why not. (Explanation should be 3 sentances or fewer.)

(e) Is there a mixed strategy Nash equlibrium in which Bob puts strictly positive prob- ability on M and R but none on L AND Ann puts strictly positive probability on both U and C? If so find it; If not explain why not. (Explanation should be 3 sentances or fewer.)

Solutions

Expert Solution

Bob
L M R
Ann U 3,4 2,0 1,3
C 3,2 4,4 4,0
D 0,2 1,1 0,1

a) Considering the best responses to opponent's strategy, I have highlighted the payoffs.

Based on them we can see that Pure NE = UL , CM

b)Rationalizable strategies. We will go on finding dominant strategies and delete dominated ones.

If we consider Bob, we'll see that L dominated R. That is, for whatever choice Ann plays, Bob choosing L has greater payoffs than choosing R. Thus L is dominant for Bob. We' ll delete R.

Bob
L M
Ann U 3,4 2,0
C 3,2 4,4
D 0,2 1,1

If we consider Ann , we'll see that C dominated D. That is, for whatever choice Bob plays, Ann choosing C has greater payoffs than choosing D. Thus C is dominant for Ann. We' ll delete D.

Bob
L M
Ann U 3,4 2,0
C 3,2 4,4

Now Ann would never play C because C dominates U. So we delete U.

Bob
L M
Ann
C 3,2 4,4

Now based on that, Bob will play M as it dominates L for best playoffs.

Bob
M
Ann
C 4,4

Thus, Ann plays C and Bob plays M

c)

Bob
L M R
Ann U 3,4 2,0 1,3
C 3,2 4,4 4,0
D 0,2 1,1 0,1

As it can be seen above, for different choices of Ann, Bob gets best payoffs in L and M but never in R. So, Bob will never choose R for a NE payoff.

There is a Nash equilibrium in which Bob puts strictly positive probability on L and M but none on R.

Bob
L M
Ann U 3,4 2,0
C 3,2 4,4
D 0,2 1,1

NE is : UL and CM.

d)

Bob
Probability p q r
L M R
Ann U 3,4 2,0 1,3
C 3,2 4,4 4,0
D 0,2 1,1 0,1

In a mixed strategy NE, bob plays L, M, R with probabilities p , q, r respectively. p + q + r = 1

The probabilities must be such that Ann must be indifferent of her choices. That is, the utility for playing U , C and D by Ann must be same.

Based on the payoffs, equating utilities :

3p + 2q + 1r = 3p + 4q + 4r = q

In question, it is given that probability on M = 0 , i.e q = 0

Therefore, 3p + 1r = 3p + 4r = 0. For this to be true, either p or r needs to be negative. But question mentions they are strictly positive.

Thus, no such NE exists.

e)

Bob
Probabilities p q r
L M R
Ann a U 3,4 2,0 1,3
b C 3,2 4,4 4,0
c D 0,2 1,1 0,1

As given : p = 0 and c = 0

Bob
Probabilities q r
M R
Ann a U 2,0 1,3
b C 4,4 4,0

Thus, we can write r = 1-q

b = 1 - a

Now, Ann must make Bob indifferent in choices and Bob must make Ann indifferent in choices :

Thus writing payoff equations based on probability:

Bob :

0a + 4b = 3a + 0b

i.e , 4 - 4a = 3a

a = 4/7 b = 3/7 - Satisfactory

Ann : 2q + r = 4q + 4r

i,e : 2q + 1 - q = 4q + 4 - 4q

q = 3 . This cannot be. Because this would make r negative.

Thus, no such NE exists.


Related Solutions

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown in...
The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown in Figure 8-23. The Lo Shu Magic Square has the following properties: l The grid contains the numbers 1 through 9 exactly. l The sum of each row, each column, and each diagonal all add up to the same number. This is shown in Figure 8-24. In a program, you can simulate a magic square using a two-dimensional array. Design a program that initializes a...
Ann and Bill play the following game in which 4 gold coins are to be won....
Ann and Bill play the following game in which 4 gold coins are to be won. Ann selects a word from the set {up, out, over} and Bill selects a word from the same set (it could be the same word). If the words selected by the two players differ, then Ann wins one gold coin, and the remainder go to Bill. If the words selected by the two players are the same, then the number of gold coins won...
Question 1 - Game Theory (7 Marks) Alice and Bob are playing a game of simultaneous...
Question 1 - Game Theory Alice and Bob are playing a game of simultaneous moves where they are deciding which concert they will attend on Saturday night. Two musicians are performing that night locally, Artist 1 and Artist 2. Alice prefers to go to Artist 1 with Bob rather than Artist 2 with Bob, and she prefers going to Artist 2 with Bob rather than going to Artist 2 alone. Moreover, she prefers going to Artist 1 alone rather than...
/*Question 3: The following data contains five columns (variables) and five rows (observations). First, read the...
/*Question 3: The following data contains five columns (variables) and five rows (observations). First, read the data into SAS to create a data set. Notice that the first, third, and the fifth variable have missing values. Please replace the missing values of the first, third, and fifth variable with 30, 40, and 50, respectively. Next, for all the variables, if a value is at least 100, make an adjustment to the value such that its new value is equal to...
Write a script to display the following patterns on the screen. Number of rows and columns...
Write a script to display the following patterns on the screen. Number of rows and columns are taken from the command arguments; if they are missing, set default to 3 (rows) and 4 (columns). Hint: you will use a nested loop. **** **** **** a) Display the source code in an editor (#4-11) b) Execute your script in the terminal, and display the command and the result (#4-12)
5. Solve for Nash Equilibrium in the following 3 Player Game Player 3: Chooses Enter Player...
5. Solve for Nash Equilibrium in the following 3 Player Game Player 3: Chooses Enter Player 2 High Low Player 1 Low 2,0,4 1,1,1 Medium 3,2,3 0,1,0 High 1,0,2 0,0,3 Player 3: Chooses Opt Out Player 2 Player 1 High Low Low 2,0,3 4,1,2 Medium 1,3,2 2,2,2 High 0,0,0 3,0,3
JavaScript Find and Replace Text Main text: a text area with 3 rows and 20 columns....
JavaScript Find and Replace Text Main text: a text area with 3 rows and 20 columns. The default text is “Hello testing”. The text area cannot be empty. • Find text: a text box for the user to key in text he/she wants to find. • Replacement text: a text box for the user to key in the replacement text. If the find text is empty, this element should be disabled (i.e. user cannot key in anything here). • Find...
Consider a pure exchange economy with two consumers, Ann (A) and Bob (B), and two commodities,...
Consider a pure exchange economy with two consumers, Ann (A) and Bob (B), and two commodities, 1 and 2, denoted by (x^A_1, x^A_2) and (x^B_1, x^B_2). Ann’s initial endowment consists of 5 units of good 1 and 10 units of good 2. Bob’s initial endowment consists of 10 unit of good 1 and 5 units of good 2. The consumers’ preferences are represented by the following utility functions:U^A(x^A_1, x^A_2) =min{x^A_1, x^A_2} and U^A(x^B_1, x^B_2)= =min{x^B_1, x^B_2}. Denote by p1 and...
Consider a pure exchange economy with two consumers, Ann (A) and Bob (B), and two commodities,...
Consider a pure exchange economy with two consumers, Ann (A) and Bob (B), and two commodities, 1 and 2, denoted by (x^A_1 , x^A_2 ) and (x^B_1 , x^B_2 ). Ann’s initial endowment consists of 15 units of good 1 and 5 units of good 2. Bob’s initial endowment consists of 5 unit of good 1 and 5 units of good 2. The consumers’ preferences are represented by the following Cobb-Douglas utility functions: U^A(x^A_1 , x^A_2 ) = (x^A_1 )^2...
The Lo Shu Magic Square is a grid with 3 rows and 3 columns, shown in figure. The Lo Shu Magic Square has the following properties:
Python programmingThe Lo Shu Magic Square is a grid with 3 rows and 3 columns, shown in figure. The Lo Shu Magic Square has the following properties:The grid contains the numbers 1 through 9 exactly.The sum of each row, each column, and each diagonal all add up to the same number as shown in figure.In a program you can simulate a magic square using a two-dimensional list. Write a function that accepts a two-dimensional list as an argument and determines...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT