Rank-1 Games With Exponentially Many Nash Equilibria
arXiv:1211.2405
Abstract
The rank of a bimatrix game (A,B) is the rank of the matrix A+B. We give a construction of rank-1 games with exponentially many equilibria, which answers an open problem by Kannan and Theobald (2010).
4 pages