Rank-1 Games With Exponentially Many Nash Equilibria
classification
💻 cs.GT
keywords
equilibriaexponentiallygamesmanyrankrank-1answersbimatrix
read the original 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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.