My understanding of mixed equilibrium is that it's basically an optimization problem: you try to tweak the probabilities of your actions so that your opponents gets the least payoff.
This involves solving two linear equations for a 2 x 2 matrix.
Is it a special case of mixed nash equilibrium? I was expecting that to be the case, but it seems easy to disprove it with a counterexample:
Say we have this payoff matrix:
A B
A' (1, 2) | (3, 100)
B' (1, 2) | (4 100)
It's easy to see that the column player should always play B since that gives them the best payoff.
However, if you treat it is as a mixed equilibrium problem, with probability A = p and probability for B = 1-p,
you get:
p + 3 - 3p = p + 4 - 4p
p = 1, which suggests that they should always play A and never play B. This seems to contradict the logical best move strategy (highlighted in bold)
Am I misunderstanding something?
Your definitions are not completely correct.
A Nash Equilibrium (NE) is a pair of strategies, not a strategy for a single player. When playing a NE, each one chooses a distribution so that the other player will not have a profitable deviation (and not the least payoff).
In your example, the column player can play A and indeed rows will not have a profitable deviation, but it's not an equilibrium strategy since you cannot pair it to any strategy of the row player. Regardless of the strategy of the row player, column will have a profitable deviation.
Having said that, indeed a pure NE is a special case of a mixed one, but when some of the players play pure, the condition is no longer indifference between his actions (only between the ones he plays with non-zero probability; which again emphasizes the fact that a NE is a pair of strategies).