Generic 4 x 4 Two Person Games Have at Most 15 Nash Equilibria
暂无分享,去创建一个
[1] B. Grünbaum,et al. An enumeration of simplicial 4-polytopes with 8 vertices , 1967 .
[2] Melvin Dresher,et al. PROBABILITY OF A PURE EQUILIBRIUM POINT IN n-PERSON GAMES , 1970 .
[3] J. Harsanyi. Oddness of the number of equilibrium points: A new proof , 1973 .
[4] L. Shapley. A note on the Lemke-Howson algorithm , 1974 .
[5] I. Y. Powers. Limiting distributions of the number of pure strategy Nash equilibria in n-person games , 1990 .
[6] Ennio Stacchetti,et al. A Bound on the Proportion of Pure Strategy Equilibria in Generic Games , 1993, Math. Oper. Res..
[7] G. Ziegler. Lectures on Polytopes , 1994 .
[8] M. Shubik,et al. On the Number of Nash Equilibria in a Bimatrix Game , 1994 .
[9] William Stanford,et al. A Note on the Probability of k Pure Nash Equilibria in Matrix Games , 1995 .
[10] William Stanford,et al. The Limit Distribution of Pure Strategy Nash Equilibria in Symmetric Bimatrix Games , 1996, Math. Oper. Res..
[11] Bernhard von Stengel. New lower bounds for the number of equilibria in bimatrix games , 1997 .
[12] Martin Shubik,et al. A theorem on the number of Nash equilibria in a bimatrix game , 1997, Int. J. Game Theory.
[13] H. Keiding. On the Maximal Number of Nash Equilibria in ann × nBimatrix Game , 1997 .
[14] Andrew McLennan,et al. The Maximal Generic Number of Pure Nash Equilibria , 1997 .
[15] Andrew McLennan,et al. The Maximal Number of Regular Totally Mixed Nash Equilibria , 1997 .