7.1 节参考文献
[1] Brouwer L E J. Über abbildung von mannigfaltigkeiten[J]. Mathematische annalen, 1911, 71(1): 97-115.
[2] Kakutani S. A generalization of Brouwer’s fixed point theorem[J]. Duke Math. J., 1941, 8(1): 457-459.
[3] Nash Jr J F. Equilibrium points in n-person games[J]. Proceedings of the national academy of sciences, 1950, 36(1): 48-49.
[4] Nash J. Non-cooperative games[J]. Annals of mathematics, 1951: 286-295.
[5] Murty K G, Yu F T. Linear complementarity, linear and nonlinear programming[M]. Berlin: Heldermann, 1988.
[6] Lemke C E, Howson, Jr J T. Equilibrium points of bimatrix games[J]. Journal of the Society for industrial and Applied Mathematics, 1964, 12(2): 413-423.
[7] Savani R, Von Stengel B. Hard ‐ to ‐ solve bimatrix games[J].
Econometrica, 2006, 74(2): 397-429.
[8] Lipton R J, Markakis E, Mehta A. Playing large games using simple strategies[C]//Proceedings of the 4th ACM Conference on Electronic Commerce. 2003: 36-41.
[9] Barman S. Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem[J]. SIAM Journal on Computing, 2018, 47(3): 960-981.
[10] Rubinstein A. Settling the complexity of computing approximate two-player Nash equilibria[J]. ACM SIGecom Exchanges, 2017,
15(2): 45-49.
[11] Papadimitriou C H. The complexity of finding Nash equilibria[J]. Algorithmic game theory, 2007, 2: 30.