Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria
AbstractThe 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 InfoTo 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.
Bibliographic InfoPaper provided by Minnesota - Center for Economic Research in its series Papers with number 300.
Length: 22 pages
Date of creation: 1997
Date of revision:
Contact details of provider:
Postal: UNIVERSITY OF MINNESOTA, CENTER FOR ECONOMIC RESEARCH, DEPARTMENT OF ECONOMICS, MINNEAPOLIS MINNESOTA 35455 U.S.A.
Web page: http://www.econ.umn.edu/
More information through EDIRC
Other versions of this item:
- McLennan, Andrew & Park, In-Uck, 1999. "Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria," Games and Economic Behavior, Elsevier, vol. 26(1), pages 111-130, January.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Ravi Kannan & Thorsten Theobald, 2010. "Games of fixed rank: a hierarchy of bimatrix games," Economic Theory, Springer, vol. 42(1), pages 157-173, January.
- Philip V. Fellman & Jonathan Vos Post, 2007. "Quantum Nash Equilibria and Quantum Computing," Papers 0707.0324, arXiv.org.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel).
If references are entirely missing, you can add them using this form.