Player 1 has strategies A, B and C. Player 2 has strategies D, E, and F.

DEF A (2, 2) (1, 3) (0,1) B (3,1) (2,1) (1,1) C (1,0) (0,0) (3,0)

Spring 2021 Prof. R. Zhao

1. (a)(2pts)DoesPlayer1haveanystrictlydominatedstrategy?Ifyes,findthemandstatewhatstrategy strictly dominates them.
2. (b)(3pts)DoesPlayer2haveanyweaklydominatedstrategy?Ifyes,findthemandstatewhatstrategy weakly dominates them.
3. (c)(2pts) Is there any weakly dominant strategy for player 1? If yes, find it.
4. (d)(2pts) Is there any weakly dominant strategy for player 2? If yes, find it.
5. (e)(3pts) Find all pure-strategy Nash equilibria. Write each equilibrium as a strategy profile, for example (A, D), rather than payoff pair (2,2).
6. (f)(3pts) Determine if each Nash equilibrium is Pareto efficient.