Question

In: Statistics and Probability

F B C A 5,-1 1,3 10,0 B 3,3 3,-1 10,0 C 1,3 6,0 10,1 Consider...

F B C
A 5,-1 1,3 10,0
B 3,3 3,-1 10,0
C 1,3 6,0 10,1

Consider the following normal form game:

Part a: Are there any pure strategy Nash equilibria?

Part b: Are there any mixed strategy Nash equilibria in which player 1 plays all three strategies, A, B, C with positive probability? Justify your answer.

Part c: Are there any mixed strategy Nash equilibria in which player1 plays only A, B with positive probability? Justify your answer.

Part d: Are there any mixed strategy Nash equilibria in which player 1 plays only B, C with positive

probability? Justify your answer.

Solutions

Expert Solution

Answer:

Given that:

Consider the following normal form game:

F B C
A 5,-1 1,3 10,0
B 3,3 3,-1 10,0
C 1,3 6,0 10,1

Part a: Are there any pure strategy Nash equilibria?

There is no any pure strategy Nash Equilibrium

Part b: Are there any mixed strategy Nash equilibria in which player 1 plays all three strategies, A, B, C with positive probability? .

Let the probabilty of player 1 going for A,B,C be p1, p2, 1-p1-p2

Probabilty of player 2 going for F,B,C be q1, q2, 1-q1-q2

So, expected payoffs for A,B,C for player 1:-

From these three equations, we will get,

The expected payoffs for A,B,C for player 1 is 0 in each case. So there is no any mixed strategy Nash Equilibrium.

Part c: Are there any mixed strategy Nash equilibria in which player1 plays only A, B with positive probability?

Player 1 plays only A & B

This implies that, player 2 cannot mix the probability q1 and q2.

So, there is no incentive for player 1 to randomize betweern A and B.

So, mixed strategy Nash Equilibrium doesn't exist.

Part d: Are there any mixed strategy Nash equilibria in which player 1 plays only B, C with positive probability?

Player 1 only plays B & C

This tells that if player 2 is willing to mix the probability q1 and q2, player 1 can randomize between B & C.

So, mixed strategy Nash equilibrium exists.


Related Solutions

(a) (f ∘ g)(3) (b) g(f(2)) (c) g(f(5)) (d) (f ∘ g)(−3) (e) (g ∘ f)(−1) (f) f(g(−1))
(a)    (f ∘ g)(3) (b)    g(f(2)) (c)    g(f(5)) (d)    (f ∘ g)(−3) (e)    (g ∘ f)(−1) (f)    f(g(−1))  
6. Consider infinitely repeated prisoner’s dilemma C D C 2,2 -1,3 D 3.-1 0,0 (a) For...
6. Consider infinitely repeated prisoner’s dilemma C D C 2,2 -1,3 D 3.-1 0,0 (a) For each δ < 1 find the shortest length of punishment that is needed in order to sustain cooperation, or show that the cooperation cannot be sustained. (b) Using the one-shot deviation principle for each δ argue whether tit-for-tat strategy is an SPE or not. The tit-for-tat strategy is to cooperate in period 1. In period t do whatever your opponent did in period t...
1. Processes A, B, C, D, E, and F require service times of 3, 5, 2,...
1. Processes A, B, C, D, E, and F require service times of 3, 5, 2, 5, 3, and 5. Their arrival times are 0, 1, 3, 9, 10, and 12. What is the average turnaround time, waiting time, response time, and throughput when using SRJF, RR (q=2), and MLF (q=22i+1). Show your work.
1. Processes A, B, C, D, E, and F require service times of 3, 5, 2,...
1. Processes A, B, C, D, E, and F require service times of 3, 5, 2, 5, 3, and 5. Their arrival times are 0, 1, 3, 9, 10, and 12. What is the average turnaround time, waiting time, response time, and throughput when using SRJF, RR (q=2), and MLF (q=22i+1). Show your work.
X on polymerisation gives neoprene. Identify X. a) 1-Chloro-1,3-butadiene b) 2-Chloro-1,3-butadiene c) 1-Methyl-1,3-butadiene d) 2-Methyl-1,3-butadiene
X on polymerisation gives neoprene. Identify X. a) 1-chloro-1,3-butadiene b) 2-chloro-1,3-butadiene c) 1-methyl-1,3-butadiene d) 2-methyl-1,3-butadiene
Consider the following vectors: →a = 5 −1 3 3 →b = 5 0 1 0...
Consider the following vectors: →a = 5 −1 3 3 →b = 5 0 1 0 →c = −10 3 −3 −7 For each of the following vectors, determine whether it is in span{→a, →b, →c}. If so, express it as a linear combination using a, b, and c as the names of the vectors above. →v1 = 5 −3 2 7 < Select an answer > →v2 = 2 7 6 −7 < Select an answer > →v3 =...
Direction ratio of line joining (2, 3, 4) and (−1, −2, 1), are: A. (−3, −5, −3) B. (−3, 1, −3) C. (−1, −5, −3) D. (−3, −5, 5)
Direction ratio of line joining (2, 3, 4) and (−1, −2, 1), are:A. (−3, −5, −3)B. (−3, 1, −3)C. (−1, −5, −3)D. (−3, −5, 5)
Find the cubic equation. F(x)=ax^3+bx^2+cx+d F(-1)=3 F(1)=1 F(2)=6 F(3)=7 What is the value of a,b,c,d
Find the cubic equation. F(x)=ax^3+bx^2+cx+d F(-1)=3 F(1)=1 F(2)=6 F(3)=7 What is the value of a,b,c,d
1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4....
1. ¬B∨(G↔J), H→(B&C) ∴(H&J)→G 2. A∨B, C↔¬(B∨D) ∴C→A 3. (A&B) ↔ (F→G), (A&F) & B∴(G→R)→R 4. T→¬B, T→¬D ∴ T→¬(B∨D) 5. ¬(M∨¬S), S→(R→M) ∴A → (¬R∨T) 6. (F&G) → I, (I∨J) → K ∴F→(G→K) 7. ¬U, O→G, ¬(O∨G) →U ∴G Prove that the arguments are valid by constructing a dedication using the rules MP, MT, DN, Conj, Simp, CS, Disj, DS, DM, CP, HS, BE, and DL. Use CP if needed.
2. Consider functions f : {1, 2, 3, 4, 5, 6} → {1, 2, 3, 4,...
2. Consider functions f : {1, 2, 3, 4, 5, 6} → {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}. (a) How many of these functions are strictly increasing (i.e. f(1) < f(2) < f(3) < f(4) < f(5) < f(6))? Hint: How many different possibilities are there for the range of f? For each range of f, how many strictly increasing functions are there? (b) How many of these functions are non-decreasing (i.e. f(1) ≤ f(2) ≤...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT