A theorem on the number of Nash equilibria in a bimatrix game

A theorem on the number of Nash equilibria in a bimatrix game

0.00 Avg rating—0 Votes
Article ID: iaor19982905
Country: Germany
Volume: 26
Issue: 3
Start Page Number: 353
End Page Number: 359
Publication Date: Jan 1997
Journal: International Journal of Game Theory
Authors: ,
Keywords: Nash theory and methods
Abstract:

We show that if y is an odd integer between 1 and 2n—1, there is an n × n bimatrix game with exactly y Nash equilibria (NE). We conjecture that this 2n—1 is a tight upper bound on the number of NE in a ‘nondegenerate’ n × n game.

Reviews

Required fields are marked *. Your email address will not be published.