Nondegeneracy of a bimatrix game
= Nondegeneracy of a bimatrix game
A <bimatrix game> is nondegenerate if every <mixed strategy> with $k$ positive coordinates has at most $k$ pure <best responses> for the other player. This condition prevents ties in the leaving-variable choice along the usual <Lemke-Howson algorithm> path and allows unique continuation once the dropped label has been selected.