So I have been taught how to find a single mixed strategy Nash equilibrium in a 2 player game by ensuring both players are indifferent to which strategy is played.
So for example:
Player 2 x 1-x A B Player 1 1 (1,0) (0,1) 2 (0,0) (3,3)
Where $x$ is probability of playing strategy A
Then for player 1 we would try find the $EU_i(X)$ (expected utility of player i playing strategy X):
$EU_1(1) = x(1) + (1-x)0$
$EU_1(2) = x(0) + (1-x)3$
$EU_1(1) = EU_1(2)$
$x = 3-3x$
$x = 3/4$
I was wondering how you go about finding multiple Mixed Strategy Nash Equilibria if they exist as well as showing that you have found all the existing ones? I can't seem to find many resources online.
I've only been studying game theory for a few weeks so please bear that in mind :)