Article thumbnail

A simplicial algorithm for computing proper Nash equilibria of finite games

By A.J.J. Talman and Z. Yang

Abstract

Stationary Point;Game Theory;Nash Equilibrium

OAI identifier:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

Suggested articles

Citations

  1. (1993). A pat.h-following procedure to find a proper equilibrium of (initc games",
  2. Bankruptcy Litigation and Optimal Debt ContractsNo.
  3. Bloemen ~LII)i 1' W'..I.
  4. Huizinga i133 I I 1. I luii.inga
  5. (1967). n'Che approximation of fixed points of a continuous mappingH,
  6. (1990). Numerical Continuation Methods, SpringerVcrlag, 13erlin,
  7. (1982). On the computation of fixed points in t.he product space of unit simplices and an application to noncooperative N person games",
  8. Socst
  9. tll(r A Dc Wacgcnacrc
  10. v:m dcr Pkicg and A.L.