Cover Image

A Theorem on the Number of Nash Equilibria in a Bimatrix Game

We show that if y is an odd integer between 1 and $2^{n}-1$, there is an $n\times n$ bimatrix game with exactly y Nash equilibria (NE). We conjecture that this $2^{n}-1$ is a tight upper bound on the number of NEs in a "nondegenerate" $n\times n$ game.
Year of publication:
1998-05-19
Authors: Shubik, Martin ; Quint, Thomas
Published in:
International Journal of Game Theory. - Springer. - Vol. 26.1997, 3, p. 353-359
Publisher: Springer
Type of publication: Article
Notes:
Received June 1994 Revised version February 1996
Source:
Persistent link: https://www.econbiz.de/10005598471
Similar items by person