Rank-1 Games With Exponentially Many Nash Equilibria
  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). 
Bernhard von Stengel
cs.GT