论文信息 - On nash subsets of bimatrix games

On nash subsets of bimatrix games

This work considers a class of bimatrix games to which some well-known structure theorems of 0-sum matrix games can be made to generalize. It is additionally shown how to construct such games and how to generate the equilibrium points defining a given game as a member of that class.

C. B. Millham | C. Millham

[1] T. Raghavan. Completely Mixed Strategies in Bimatrix Games , 1970 .

[2] Charles Terence Clegg Wall,et al. A Remark on Gradient Dynamical Systems , 1972 .

[3] 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.

[4] Chandler Davis. THEORY OF POSITIVE LINEAR DEPENDENCE. , 1954 .

[5] C. B. Millham. Constructing bimatrix games with special properties , 1972 .

[6] M. Balinski. An algorithm for finding all vertices of convex polyhedral sets , 1959 .

[7] O. Mangasarian. Equilibrium Points of Bimatrix Games , 1964 .

[8] G. C. Shephard. Diagrams for Positive Bases , 1971 .

[9] C. Millham. On the Structure of Equilibrium Points in Bimatrix Games , 1968 .

[10] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .

[11] Harlan D. Mills,et al. Equilibrium Points in Finite Games , 1960 .