A note on polymatrix games

This work is concerned with the class ofn-person games called polymatrix games (Yanovskaya (1968)). The structure of the set of Nash equilibrium points in a polymatrix game is studied and characterizations of these games are given.

[1]  J. Howson.  Equilibria of Polymatrix Games , 1972 .

[2]  M. Jansen.  Maximal nash subsets for bimatrix games , 1981 .

[3]  C. B. Millham,et al.  On nash subsets and mobility chains in bimatrix games , 1976 .

[4]  J. Nash.  Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[5]  J. Nash,et al.  NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.

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

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