论文信息 - Bimatrix games have quasi-strict equilibria - 字舞流文

Bimatrix games have quasi-strict equilibria

In this paper we show that every bimatrix game has at least one quasi-striet equilibrium, i.e. a Nash-equilibrium with the property that every player assigns positive probability to each of his pure best replies.

Henk Norde | H. Norde

[1] Peter Borm. On game theoretic models and solution concepts , 1990 .

[2] H. Meister,et al. A generalization of an oddness-theorem for bimatrix games , 1984 .

[3] J. Harsanyi. Games with randomly disturbed payoffs: A new rationale for mixed-strategy equilibrium points , 1973 .

[4] John Arnold Kalman. Continuity and convexity of projections and barycentric coordinates in convex polyhedra , 1961 .

[5] 김여근. 쌍행렬게임의 평형점 ( Equilibrium Points of Bimatrix Games : A State-of-the-Art ) , 1982 .

[6] M. Jansen. Regular equilibrium points of bimatrix games , 1987 .

[7] E. Damme. Refinements of the Nash Equilibrium Concept , 1983 .

[8] Akira Okada. Strictly perfect equilibrium points of bimatrix games , 1984 .

[9] M. J. M. Jansen,et al. Regularity and Stability of Equilibrium Points of Bimatrix Games , 1981, Math. Oper. Res..