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 x n bimatrix game with exactly y Nash equilibria (NE). We conjecture that this 2^{n} - 1 is a tight upper for n <= 3, and provide bounds on the number of NEs in m x n nondegenerate games when min(m,n) <= 4.

MoreLess

Year of publication:	1994-12
Authors:	Quint, Thomas ; Shubik, Martin
Institutions:	Cowles Foundation for Research in Economics, Yale University

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Cowles Foundation Discussion Papers.
Type of publication:	Book / Working Paper
Language:	English
Notes:	CFP 958. Published in International Journal of Game Theory (1997), 26: 353-359 The price is None Number 1089 17 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005762817