Practical Performance of Refinements of Nash Equilibria in Extensive-Form Zero-Sum Games
暂无分享,去创建一个
[1] R. McKelvey,et al. Quantal Response Equilibria for Normal Form Games , 1995 .
[2] Michael P. Wellman. Trading Agents , 2011, Trading Agents.
[3] Peter I. Cowling,et al. Information Set Monte Carlo Tree Search , 2012, IEEE Transactions on Computational Intelligence and AI in Games.
[4] Sam Ganzfried,et al. Improving Performance in Imperfect-Information Games with Large State and Action Spaces by Solving Endgames , 2013, AAAI 2013.
[5] Tuomas Sandholm,et al. The State of Solving Large Incomplete-Information Games, and Application to Poker , 2010, AI Mag..
[6] R. Myerson. Refinements of the Nash equilibrium concept , 1978 .
[7] H. W. Kuhn,et al. 11. Extensive Games and the Problem of Information , 1953 .
[8] Andrew McLennan,et al. Gambit: Software Tools for Game Theory , 2006 .
[9] Milind Tambe,et al. Security and Game Theory - Algorithms, Deployed Systems, Lessons Learned , 2011 .
[10] E. Damme. A relation between perfect equilibria in extensive form games and proper equilibria in normal form games , 1984 .
[11] Michael H. Bowling,et al. A New Algorithm for Generating Equilibria in Massive Zero-Sum Games , 2007, AAAI.
[12] Peter Bro Miltersen,et al. Fast algorithms for finding proper strategies in game trees , 2008, SODA '08.
[13] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[14] Bernhard von Stengel,et al. Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.
[15] Dana S. Nau,et al. An Analysis of Forward Pruning , 1994, AAAI.
[16] E. Damme. Stability and perfection of Nash equilibria , 1987 .
[17] Peter Bro Miltersen,et al. Computing a quasi-perfect equilibrium of a two-player game , 2010 .
[18] Jan Willemson,et al. Improved Monte-Carlo Search , 2006 .