Fast Equilibrium Computation for Infinitely Repeated Games
暂无分享,去创建一个
[1] Peter Stone,et al. A polynomial-time nash equilibrium algorithm for repeated games , 2003, EC '03.
[2] Kristoffer Arnsfelt Hansen,et al. Approximability and Parameterized Complexity of Minmax Values , 2008, WINE.
[3] Ilan Adler. The equivalence of linear programs and zero-sum games , 2013, Int. J. Game Theory.
[4] Vincent Conitzer,et al. A double oracle algorithm for zero-sum security games on graphs , 2011, AAMAS.
[5] Yoav Shoham,et al. Game Theory Pragmatics: A Challenge for AI , 2008, AAAI.
[6] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[7] Kousha Etessami,et al. On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..
[8] Yoav Shoham,et al. Computer science and game theory , 2008, CACM.
[9] Paul G. Spirakis,et al. Equilibrium Points in Fear of Correlated Threats , 2008, WINE.
[10] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .
[11] Paul W. Goldberg,et al. The complexity of computing a Nash equilibrium , 2006, STOC '06.
[12] Adam Tauman Kalai,et al. The myth of the folk theorem , 2008, Games Econ. Behav..
[13] Vincent Conitzer,et al. Multi-Step Multi-Sensor Hider-Seeker Games , 2009, IJCAI.
[14] 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..
[15] Paul W. Goldberg,et al. The Complexity of Computing a Nash Equilibrium , 2009, SIAM J. Comput..