# Math Help - Game Theory -Deletion of strictly dominated strategies

1. ## Game Theory -Deletion of strictly dominated strategies

Hi, I was wondering if I could get some help with these questions.

a) I (think) I can do this one, mutual best responses would suggest that the nash equilbria are (a,a), (a,b) and (b,c)

b) Now this is the question where I get stuck. Player 1's strategy c can be eliminated, as it is strictly dominated by a (and b). But I am not sure what to do from here, I am guessing that I have to eliminate a strategy for player 2, but I can't see any that are strictly dominated. There don't even seem to be any strategies that are eliminated by mixed strategies..

2. no ideas?