2000 character limit reached
Rank-1 Games With Exponentially Many Nash Equilibria (1211.2405v1)
Published 11 Nov 2012 in cs.GT
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).