A note on bimatrix game maximal Selten subsets
暂无分享,去创建一个
[1] Harlan D. Mills,et al. Equilibrium Points in Finite Games , 1960 .
[2] O. Mangasarian. Equilibrium Points of Bimatrix Games , 1964 .
[3] C. B. Millham,et al. On nash subsets of bimatrix games , 1974 .
[4] Pierre Hansen,et al. A New Sequence Form Approach for the Enumeration and Refinement of All Extreme Nash Equilibria for Extensive Form Games , 2009, IGTR.
[5] O. Mangasarian,et al. Two-person nonzero-sum games and quadratic programming , 1964 .
[6] Bernhard von Stengel,et al. Computing Normal Form Perfect Equilibria for Extensive Two-Person Games , 2002 .
[7] Stef Tijs,et al. On the structure of the set of perfect equilibria in bimatrix games , 1993 .
[8] M. Jansen. Maximal nash subsets for bimatrix games , 1981 .
[9] C. Bron,et al. Algorithm 457: finding all cliques of an undirected graph , 1973 .
[10] E. Damme. Refinements of the Nash Equilibrium Concept , 1983 .
[11] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[12] Pierre Hansen,et al. Enumeration of All Extreme Equilibria of Bimatrix Games , 1996, SIAM J. Sci. Comput..
[13] P. Pardalos,et al. Pareto optimality, game theory and equilibria , 2008 .
[14] Roger B. Myerson,et al. Game theory - Analysis of Conflict , 1991 .
[15] Pierre Hansen,et al. On proper refinement of Nash equilibria for bimatrix games , 2012, Autom..
[16] C. B. Millham,et al. On nash subsets and mobility chains in bimatrix games , 1976 .
[17] D. Avis,et al. Enumeration of Nash equilibria for two-player games , 2010 .
[18] P. Hansen,et al. Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games , 2003 .
[19] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.