On the structure of the set of perfect equilibria in bimatrix games
暂无分享,去创建一个
Stef Tijs | Peter Borm | M.J.M. Jansen | P. Borm | S. Tijs | M. Jansen | J. Potters | J.A.M. Potters
[1] E. Damme. Refinements of the Nash Equilibrium Concept , 1983 .
[2] H. F. Bohnenblust,et al. Solutions of Discrete, Two-Person Games , 1949 .
[3] D. Gale,et al. 4. SOLUTIONS OF FINITE TWO-PERSON GAMES , 1951 .
[4] C. B. Millham,et al. On nash subsets of bimatrix games , 1974 .
[5] M. Jansen. Maximal nash subsets for bimatrix games , 1981 .
[6] Peter Borm,et al. On strictly perfect sets , 1994 .
[7] C. B. Millham,et al. On nash subsets and mobility chains in bimatrix games , 1976 .
[8] H W Kuhn,et al. AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES. , 1961, Proceedings of the National Academy of Sciences of the United States of America.
[9] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[10] C. B. Millham. Constructing bimatrix games with special properties , 1972 .
[11] J. Nash,et al. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[12] N. Vorob’ev. Equilibrium Points in Bimatrix Games , 1958 .