Simultaneous Abstraction and Equilibrium Finding in Games
暂无分享,去创建一个
[1] Richard G. Gibson. Regret Minimization in Games and the Development of Champion Multiplayer Computer Poker-Playing Agents , 2014 .
[2] Tuomas Sandholm,et al. Regret Transfer and Parameter Optimization , 2014, AAAI.
[3] Tuomas Sandholm,et al. A Competitive Texas Hold'em Poker Player via Automated Abstraction and Real-Time Equilibrium Computation , 2006, AAAI.
[4] Tuomas Sandholm,et al. Extensive-Form Game Imperfect-Recall Abstractions With Bounds , 2014, ArXiv.
[5] Oskari Tammelin,et al. Solving Large Imperfect Information Games Using CFR+ , 2014, ArXiv.
[6] SandholmTuomas,et al. Lossless abstraction of imperfect information games , 2007 .
[7] Kevin Waugh,et al. Solving Games with Functional Regret Estimation , 2014, AAAI Workshop: Computer Poker and Imperfect Information.
[8] Michael H. Bowling,et al. Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.
[9] J. Meigs,et al. WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.
[10] Kevin Waugh,et al. Abstraction pathologies in extensive games , 2009, AAMAS.
[11] Michael H. Bowling,et al. Solving Imperfect Information Games Using Decomposition , 2013, AAAI.
[12] Michael H. Bowling,et al. No-Regret Learning in Extensive-Form Games with Imperfect Recall , 2012, ICML.
[13] Michael Johanson,et al. Measuring the Size of Large No-Limit Poker Games , 2013, ArXiv.
[14] Ian Frank,et al. Revised Papers from the Second International Conference on Computers and Games , 2000 .
[15] Michael L. Littman,et al. Abstraction Methods for Game Theoretic Poker , 2000, Computers and Games.
[16] Duane Szafron,et al. Automated Action Abstraction of Imperfect Information Extensive-Form Games , 2011, AAAI.
[17] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[18] Dan Suciu,et al. Journal of the ACM , 2006 .
[19] R. Lathe. Phd by thesis , 1988, Nature.
[20] Tuomas Sandholm,et al. Lossy stochastic game abstraction with bounds , 2012, EC '12.
[21] Tuomas Sandholm,et al. The State of Solving Large Incomplete-Information Games, and Application to Poker , 2010, AI Mag..
[22] Kevin Waugh,et al. Monte Carlo Sampling for Regret Minimization in Extensive Games , 2009, NIPS.
[23] Jonathan Schaeffer,et al. Approximating Game-Theoretic Optimal Strategies for Full-scale Poker , 2003, IJCAI.
[24] Tuomas Sandholm,et al. Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent , 2015, AAAI Workshop: Computer Poker and Imperfect Information.
[25] Tuomas Sandholm,et al. Potential-Aware Imperfect-Recall Abstraction with Earth Mover's Distance in Imperfect-Information Games , 2014, AAAI.
[26] Duane Szafron,et al. Using Sliding Windows to Generate Action Abstractions in Extensive-Form Games , 2012, AAAI.
[27] Kevin Waugh,et al. A Unified View of Large-Scale Zero-Sum Equilibrium Computation , 2014, AAAI Workshop: Computer Poker and Imperfect Information.
[28] Tuomas Sandholm,et al. Action Translation in Extensive-Form Games with Large Action Spaces: Axioms, Paradoxes, and the Pseudo-Harmonic Mapping , 2013, IJCAI.
[29] E. Jackson. A Time and Space Efficient Algorithm for Approximately Solving Large Imperfect Information Games , 2014 .
[30] Tuomas Sandholm,et al. Extensive-form game abstraction with bounds , 2014, EC.
[31] Michael H. Bowling,et al. Evaluating state-space abstractions in extensive-form games , 2013, AAMAS.
[32] Kevin Waugh,et al. Strategy Grafting in Extensive Games , 2009, NIPS.