New maximal numbers of equilibria in bimatrix games (Q1293674)

The author refutes a conjecture by \textit{T. Quint} and \textit{M. Shubik} [Int. J. Game Theory 26, 353-359 (1997; Zbl 0880.90141)] by showing that a \(d\times d\) bimatrix game is not limited to \(2^d-1\) Nash equilibria, but may have as many as \(2.414^d/\sqrt{d}\) equilibria. This lower bound is close to the known upper bound of \(2.598^d/\sqrt{d}\). He uses an equivalent formulation of the problem in terms of polytopes with \(2d\) facets in \(d\)-space and considers polytopes that have all vertices on the \(d\)-dimensional moment curve.