The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1995), who arrives at this result by computer enumeration, our argument is based on a collection of lemmas that constrain the set of equilibria. Several of these pertain to any common number d of pure strategies for the two agents.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Minnesota - Center for Economic Research in its series Papers with number
300.
Length: 22 pages Date of creation: 1997 Date of revision: Handle: RePEc:fth:minner:300
Contact details of provider: Postal: UNIVERSITY OF MINNESOTA, CENTER FOR ECONOMIC RESEARCH, DEPARTMENT OF ECONOMICS, MINNEAPOLIS MINNESOTA 35455 U.S.A. Phone: (612)625-6353 Fax: (612)624-0209 Email: Web page: http://www.econ.umn.edu/ More information through EDIRC
For technical questions regarding this item, or to correct its listing, contact: (Thomas Krichel).
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
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.)