On the maximal number of nash equilibria in ann × nbimatrix game

Games and Economic Behavior

Volumn 21, Issue 1-2, 1997, Pages 148-160

  Keiding, Hans ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031256798     PISSN: 08998256     EISSN: None     Source Type: Journal    
DOI: 10.1006/game.1997.0531     Document Type: Article

References (9)

1. Bohnenblust H. F., Karlin S., Shapley L. S. Solutions of Discrete Two-Person Games. Contributions to the Theory of Games, Annals of Mathematical Studies. 1950;Princeton Univ. Press, Princeton.
2. Brøndsted A. M. An Introduction to Convex Polytopes. 1983;Springer-Verlag.
3. Gale D., Sherman S. Solutions of Finite Two-Person Games. Kuhn H. W., Tucker A. W. Contributions to the Theory of Games, Annals of Mathematical Studies. 1950;Princeton Univ. Press, Princeton.
4. Grünbaum B. Convex Polytopes. 1967;Wiley, New York.
5. Grünbaum B., Sreedharan V. P. An Enumeration of Simplicial 4-Polytopes with 8 Vertices. J. Combinatorial Theory. 2:1967;437-465.
6. McMullen P. The Numbers of Faces of Simplicial Polytopes. Israel J. Math. 9:1971;559-570.
7. T. Quint, M. Shubik, 1994, On the Number of Nash Equilibria in a Bimatrix Game.
8. Shapley L. S. A Note on the Lemke-Hawson Algorithm. Math. Programming Study. 1:1974;175-189.
9. Ziegler G. M. Lectures on Polytopes. 1995;Springer-Verlag, Berlin/New York.