: otherwise. Can this game be solved by Iterated Deletion of Strictly Dominated Strate- gies? What about the Iterated Deletion of Weakly Dominated Strategies? (b) Now suppose that there are 4 players, and player 4 ("the contrarian" ) has payoffs given by u (x) = (x, - x)2 (i.e. they want to be as far away from the mean). The other 3 players have the payoffs given by 200 - (x; - 2z )2. i. Is strategy a* = 25 strictly dominated by a pure strategy for player 4? ii. Prove that each x E (0, 100) is strictly dominated by a mixed strategy for player 4. iii. Compute the set of rationalizable strategies for each player. Show your work