Linear solvers for nonlinear games: using pivoting algorithms to find Nash equilibria in n-player games
暂无分享,去创建一个
Kevin Leyton-Brown | Albert Xin Jiang | James R. Wright | J. R. Wright | Kevin Leyton-Brown | A. Jiang
[1] Christos H. Papadimitriou,et al. The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games , 2006, ICALP.
[2] Andrew McLennan,et al. Gambit: Software Tools for Game Theory , 2006 .
[3] Yoav Shoham,et al. Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[4] Inbal Talgam-Cohen,et al. A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium , 2010, SAGT.
[5] Robert Wilson,et al. Computing Nash equilibria by iterated polymatrix approximation , 2004 .
[6] J. Howson. Equilibria of Polymatrix Games , 1972 .
[7] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[8] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[9] Robert Wilson,et al. A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.