Enumerating the Nash equilibria of rank 1-games

Thorsten Theobald

A bimatrix game $(A,B)$ is called a game of rank $k$ if the rank of the matrix $A+B$ is at most $k$. We consider the problem of enumerating the Nash equilibria in (non-degenerate)…