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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Length: 17 pages Date of creation: Dec 1994 Date of revision: Publication status: Published in International Journal of Game Theory (1997), 26: 353-359 Handle: RePEc:cwl:cwldpp:1089
Order Information: Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA
For technical questions regarding this item, or to correct its listing, contact: (Glena Ames).
Related research
Keywords:
Other versions of this item:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)