Regret Minimization in Games and the Development of Champion Multiplayer Computer Poker-Playing Agents

[1]  Martin Zinkevich,et al.  The Annual Computer Poker Competition , 2013, AI Mag..

[2]  Nathan R. Sturtevant,et al.  A parameterized family of equilibrium profiles for three-player kuhn poker , 2013, AAMAS.

[3]  Michael H. Bowling,et al.  Evaluating state-space abstractions in extensive-form games , 2013, AAMAS.

[4]  Michael Johanson,et al.  Measuring the Size of Large No-Limit Poker Games , 2013, ArXiv.

[5]  Michael H. Bowling,et al.  Monte carlo sampling and regret minimization for equilibrium computation and decision-making in large extensive form games , 2013 .

[6]  Duane Szafron,et al.  Efficient Monte Carlo Counterfactual Regret Minimization in Games with Many Player Actions , 2012, NIPS.

[7]  Duane Szafron,et al.  Generalized Sampling and Variance in Counterfactual Regret Minimization , 2012, AAAI.

[8]  Michael H. Bowling,et al.  Finding Optimal Abstract Strategies in Extensive-Form Games , 2012, AAAI.

[9]  Michael H. Bowling,et al.  Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization , 2012, AAMAS.

[10]  Michael H. Bowling,et al.  No-Regret Learning in Extensive-Form Games with Imperfect Recall , 2012, ICML.

[11]  Duane Szafron,et al.  On Strategy Stitching in Large Extensive Form Multiplayer Games , 2011, NIPS.

[12]  Kevin Waugh,et al.  Accelerating Best Response Calculation in Large Extensive Games , 2011, IJCAI.

[13]  Duane Szafron,et al.  Regret Minimization in Multiplayer Extensive Games , 2011, IJCAI.

[14]  Tuomas Sandholm,et al.  Computing equilibria by incorporating qualitative models? , 2010, AAMAS.

[15]  Duane Szafron,et al.  Using counterfactual regret minimization to create competitive multiplayer poker agents , 2010, AAMAS.

[16]  Javier Peña,et al.  Smoothing Techniques for Computing Nash Equilibria of Sequential Games , 2010, Math. Oper. Res..

[17]  Ludovic Renou,et al.  Minimax Regret and Strategic Uncertainty , 2008, J. Econ. Theory.

[18]  Kevin Waugh,et al.  Strategy Grafting in Extensive Games , 2009, NIPS.

[19]  Kevin Waugh,et al.  Monte Carlo Sampling for Regret Minimization in Extensive Games , 2009, NIPS.

[20]  Kevin Waugh,et al.  Abstraction in Large Extensive Games , 2009 .

[21]  Kevin Waugh,et al.  A Practical Use of Imperfect Recall , 2009, SARA.

[22]  Michael H. Bowling,et al.  Probabilistic State Translation in Extensive Games with Large Action Sets , 2009, IJCAI.

[23]  Joseph Y. Halpern,et al.  Iterated Regret Minimization: A New Solution Concept , 2009, IJCAI.

[24]  Tuomas Sandholm,et al.  Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information , 2009, IJCAI.

[25]  Miroslav Dudík,et al.  A Sampling-Based Approach to Computing Equilibria in Succinct Extensive-Form Games , 2009, UAI.

[26]  Kevin Waugh,et al.  Abstraction pathologies in extensive games , 2009, AAMAS.

[27]  Bernhard von Stengel,et al.  Extensive-Form Correlated Equilibrium: Definition and Computational Complexity , 2008, Math. Oper. Res..

[28]  David Silver,et al.  Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Achieving Master Level Play in 9 × 9 Computer Go , 2022 .

[29]  Duane Szafron,et al.  Strategy evaluation in extensive games with importance sampling , 2008, ICML '08.

[30]  Tuomas Sandholm,et al.  Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments , 2008, AAMAS.

[31]  Troels Bjerre Lund,et al.  A heads-up no-limit Texas Hold'em poker player: discretized betting models and automatically generated equilibrium-finding programs , 2008, AAMAS.

[32]  Bret Hoehn,et al.  Effective short-term opponent exploitation in simplified poker , 2005, Machine Learning.

[33]  Michael H. Bowling,et al.  Regret Minimization in Games with Incomplete Information , 2007, NIPS.

[34]  Troels Bjerre Lund,et al.  Potential-Aware Automated Abstraction of Sequential Games, and Holistic Equilibrium Analysis of Texas Hold'em Poker , 2007, AAAI.

[35]  Tuomas Sandholm,et al.  Better automated abstraction techniques for imperfect information games, with application to Texas Hold'em poker , 2007, AAMAS '07.

[36]  Y. Mansour,et al.  Algorithmic Game Theory: Learning, Regret Minimization, and Equilibria , 2007 .

[37]  Geoffrey J. Gordon.  No-regret Algorithms for Online Convex Programs , 2006, NIPS.

[38]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[39]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[40]  Zheng Li,et al.  Bounds for Regret-Matching Algorithms , 2006, AI&M.

[41]  Michael H. Bowling,et al.  Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.

[42]  Tuomas Sandholm,et al.  Optimal Rhode Island Hold'em Poker , 2005, AAAI.

[43]  Vincent Conitzer,et al.  Complexity of (iterated) dominance , 2005, EC '05.

[44]  Xi Chen,et al.  3-NASH is PPAD-Complete , 2005, Electron. Colloquium Comput. Complex..

[45]  Christos H. Papadimitriou,et al.  Three-Player Games Are Hard , 2005, Electron. Colloquium Comput. Complex..

[46]  Shlomo Zilberstein,et al.  Dynamic Programming for Partially Observable Stochastic Games , 2004, AAAI.

[47]  Jonathan Schaeffer,et al.  The challenge of poker , 2002, Artif. Intell..

[48]  Jonathan Schaeffer,et al.  Opponent Modeling in Poker , 1998, AAAI/IAAI.

[49]  Jonathan Schaeffer,et al.  Poker as Testbed for AI Research , 1998, Canadian Conference on AI.

[50]  S. Hart,et al.  A simple adaptive procedure leading to correlated equilibrium , 2000 .

[51]  Michael Buro,et al.  The Othello Match of the Year: Takeshi Murakami vs. Logistello , 1997, J. Int. Comput. Games Assoc..

[52]  Ariel Rubinstein,et al.  On the Interpretation of Decision Problems with Imperfect Recall , 1996, TARK.

[53]  M. Kaneko,et al.  Behavior strategies, mixed strategies and perfect recall , 1995 .

[54]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[55]  Bernhard von Stengel,et al.  Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[56]  Eitan Zemel,et al.  The Complexity of Eliminating Dominated Strategies , 1993, Math. Oper. Res..

[57]  D. Koller,et al.  The complexity of two-person zero-sum games in extensive form , 1992 .

[58]  D. Knuth,et al.  A note on strategy elimination in bimatrix games , 1988 .

[59]  Ken Thompson,et al.  Retrograde Analysis of Certain Endgames , 1986, J. Int. Comput. Games Assoc..