1.Perform iterative elimination of dominated strategies on the game. Draw the new table for each iteration as shown in the lecture video. Write corresponding actions at left and up of the table. Explain why are you removing each row or column. You should reach a 22 game. Rewrite the table separately. 2. From the 22 game you get in question 1, find a mixed strategy 1=(p,1p) for Player 1 that will make Player 2 indifferent about two actions. 3.Find a mixed strategy 2=(q,1q) for Player 2 that will make Player 1 indifferent about two actions. 4.If the players are playing the mixed strategies 1 and 2 , they both will indifferent about their strategies, hence the strategy profile (1,2) will be a Nash Equilibrium of this game. Find the expected utility for both Player 1 u1(1,2) and Player 2 u2(1,2) at this Nash Equilibrium.

Consider the following representation of a Normal form game. actions y 2 W a (42,31) (60,67) (65,46) (32,15) b (47,26) (33,33) (58,53) (43,41) (43,34) (19,46) (52,33) (24,44) d (25,30) (84,63) (47,85) (39,14) Here each cell in the table represents an ordered pair. First element is payoff of the first player and second element is payoff of the second player. The letters a, b, c, d, x, y, z, wrepresent the actions. Consider the following representation of a Normal form game. actions y 2 W a (42,31) (60,67) (65,46) (32,15) b (47,26) (33,33) (58,53) (43,41) (43,34) (19,46) (52,33) (24,44) d (25,30) (84,63) (47,85) (39,14) Here each cell in the table represents an ordered pair. First element is payoff of the first player and second element is payoff of the second player. The letters a, b, c, d, x, y, z, wrepresent the actions