论文信息 - Rank-1 Games With Exponentially Many Nash Equilibria

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

[1] H. Keiding. On the Maximal Number of Nash Equilibria in ann × nBimatrix Game , 1997 .

[2] Thorsten Theobald,et al. Games of fixed rank: a hierarchy of bimatrix games , 2005, SODA '07.

[3] Rahul Savani,et al. Solve a bimatrix game , 2002 .

[4] Ruta Mehta,et al. Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm , 2011, STOC '11.

[5] Martin Shubik,et al. A bound on the number of Nash equilibria in a coordination game , 2002 .

[6] B. Stengel,et al. COMPUTING EQUILIBRIA FOR TWO-PERSON GAMES , 1996 .

[7] A. McLennan,et al. Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria , 1999 .

[8] Xiaotie Deng,et al. Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[9] Martin Shubik,et al. A theorem on the number of Nash equilibria in a bimatrix game , 1997, Int. J. Game Theory.

[10] Bernhard von Stengel,et al. New Maximal Numbers of Equilibria in Bimatrix Games , 1999, Discret. Comput. Geom..

[11] Katta G. Murty,et al. Computational complexity of parametric linear programming , 1980, Math. Program..