Online Convex Optimization for Sequential Decision Processes and Extensive-Form Games
暂无分享,去创建一个
Tuomas Sandholm | Christian Kroer | Gabriele Farina | T. Sandholm | Christian Kroer | Gabriele Farina
[1] S. Hart,et al. A simple adaptive procedure leading to correlated equilibrium , 2000 .
[2] Javier Peña,et al. Smoothing Techniques for Computing Nash Equilibria of Sequential Games , 2010, Math. Oper. Res..
[3] Tuomas Sandholm,et al. Regret Minimization in Behaviorally-Constrained Zero-Sum Games , 2017, ICML.
[4] Michael H. Bowling,et al. Solving Heads-Up Limit Texas Hold'em , 2015, IJCAI.
[5] B. Stengel,et al. Efficient Computation of Behavior Strategies , 1996 .
[6] Elad Hazan,et al. Extracting certainty from uncertainty: regret bounded by variation in costs , 2008, Machine Learning.
[7] Kevin Waugh,et al. Faster algorithms for extensive-form game solving via improved smoothing functions , 2018, Mathematical Programming.
[8] Tuomas Sandholm,et al. Dynamic Thresholding and Pruning for Regret Minimization , 2017, AAAI.
[9] Michael H. Bowling,et al. Tractable Objectives for Robust Policy Optimization , 2012, NIPS.
[10] Kevin Waugh,et al. DeepStack: Expert-level artificial intelligence in heads-up no-limit poker , 2017, Science.
[11] Yurii Nesterov,et al. Excessive Gap Technique in Nonsmooth Convex Minimization , 2005, SIAM J. Optim..
[12] O. SIAMJ.,et al. PROX-METHOD WITH RATE OF CONVERGENCE O(1/t) FOR VARIATIONAL INEQUALITIES WITH LIPSCHITZ CONTINUOUS MONOTONE OPERATORS AND SMOOTH CONVEX-CONCAVE SADDLE POINT PROBLEMS∗ , 2004 .
[13] Michael H. Bowling,et al. No-Regret Learning in Extensive-Form Games with Imperfect Recall , 2012, ICML.
[14] Kevin Waugh,et al. Theoretical and Practical Advances on Smoothing for Extensive-Form Games , 2017, EC.
[15] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .
[16] Michael H. Bowling,et al. Regret Minimization in Games with Incomplete Information , 2007, NIPS.
[17] Michael H. Bowling,et al. Bayes' Bluff: Opponent Modelling in Poker , 2005, UAI 2005.
[18] Tuomas Sandholm,et al. Imperfect-Recall Abstractions with Bounds in Games , 2014, EC.
[19] Tuomas Sandholm,et al. Sequential Planning for Steering Immune System Adaptation , 2016, IJCAI.
[20] Tuomas Sandholm,et al. Game theory-based opponent modeling in large imperfect-information games , 2011, AAMAS.
[21] Martin Zinkevich,et al. Online Convex Programming and Generalized Infinitesimal Gradient Ascent , 2003, ICML.
[22] Tuomas Sandholm,et al. Solving Imperfect-Information Games via Discounted Regret Minimization , 2018, AAAI.
[23] H. Kuhn. 9. A SIMPLIFIED TWO-PERSON POKER , 1951 .
[24] Yoram Singer,et al. Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.
[25] Nicola Gatti,et al. Extensive-Form Perfect Equilibrium Computation in Two-Player Games , 2017, AAAI.
[26] S. Ross. GOOFSPIEL -- THE GAME OF PURE STRATEGY , 1971 .
[27] Kevin Waugh,et al. Faster First-Order Methods for Extensive-Form Game Solving , 2015, EC.
[28] Noam Brown,et al. Superhuman AI for heads-up no-limit poker: Libratus beats top professionals , 2018, Science.
[29] Tuomas Sandholm,et al. Steering Evolution Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and Synthetic Biology , 2015, AAAI.
[30] Tuomas Sandholm,et al. Smoothing Method for Approximate Extensive-Form Perfect Equilibrium , 2017, IJCAI.
[31] Neil Burch,et al. Heads-up limit hold’em poker is solved , 2015, Science.
[32] Tuomas Sandholm,et al. Safe and Nested Subgame Solving for Imperfect-Information Games , 2017, NIPS.
[33] J. Zico Kolter,et al. What game are we playing? End-to-end learning in normal and extensive form games , 2018, IJCAI.
[34] Elad Hazan,et al. Introduction to Online Convex Optimization , 2016, Found. Trends Optim..
[35] Kurt Keutzer,et al. Regret Minimization for Partially Observable Deep Reinforcement Learning , 2017, ICML.