Rank-1 Games With Exponentially Many Nash Equilibria

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

Cited by in corpus (2)

• Fast Algorithms for Rank-1 Bimatrix Games
• Settling Some Open Problems on 2-Player Symmetric Nash Equilibria