Bimatrix games have quasi-strict equilibria

@article{Norde1999BimatrixGH,
  title={Bimatrix games have quasi-strict equilibria},
  author={Henk Norde},
  journal={Math. Program.},
  year={1999},
  volume={85},
  pages={35-49}
}
In this paper we show that every bimatrix game has at least one quasi-strict equilibrium, i.e. a Nash-equilibrium with the property that every player assigns positive probability to each of his pure best replies. 
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

On Game Theoretic Models and Solution Concepts

  • P.E.M. Borm
  • Ph. D. Thesis, Department of Mathematics,
  • 1990
1 Excerpt

Equilibrium Points of Bimatrix Games

  • M.J.M. Jansen
  • eds. Surveys in Game Theory and Related Topics,
  • 1987
1 Excerpt

Regular Equilibrium Points of Bimatrix Games

  • M.J.M. Jansen
  • OR Spektrum
  • 1987
1 Excerpt

A Generalization of an Oddness-Theorem for Bimatrix Games

  • H. Meister
  • OR Spektrum
  • 1984
1 Excerpt

Strictly Perfect Equilibrium Points of Bimatrix Games

  • A. Okada
  • Int. J. Game Theory
  • 1984
1 Excerpt

Games with Randomly Disturbed Payoffs: A New Rationale for Mixed-Strategy Equilibrium Points

  • J. C. Harsanyi
  • Int. J. Game Theory
  • 1973
1 Excerpt

Continuity and Convexity of Projections and Barycentric Coordinates in Convex Polyhedra

  • J. A. Kalman
  • Pacific J. Math
  • 1961
1 Excerpt

Similar Papers

Loading similar papers…