Consider the following bimatrix game
$(2,6)\ \ \ (4,2) \\ (6,0) \ \ \ (0,4) $
I have been asked to compute all equilibria of this game, as well as the maximin strategies for both players. Now I used the Lemke-Howson algorithm to calculate $x = y =(\frac12,\frac12)$ to be a Nash equilibrium for this game.
My question is, how do I know if there are any more equilibria? Also, how is it possible to calculate the maximin strategies?
Any help would be greatly appreciated.