Support enumeration for a bimatrix game
= Support enumeration for a bimatrix game
Enumerate pairs of <strategy supports>, solve the equations making each supported action indifferent, then check strict positivity of supported probabilities and all omitted-action payoff inequalities. These conditions suffice for a <Nash equilibrium>. Under <nondegeneracy of a bimatrix game>, only pairs of equal support size need be tested.