Equilibria of Polymatrix Games
暂无分享,去创建一个
A constructive existence proof is given for equilibria of polymatrix games. The construction is based on a generalization of the almost-complementary paths used for the linear complementarity problem.
[1] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[2] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[3] C. E. Lemke,et al. Bimatrix Equilibrium Points and Mathematical Programming , 1965 .
[4] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .