Fetching the paper…
Reading the bibliography…
A recent line of work has established uncoupled learning dynamics such that, when employed by all players in a game, each player's \emph{regret} after $T$ repetitions grows polylogarithmically in $T$, an exponential improvement over the traditional guarantees within the no-regret framework.
Online learning and online convex optimization
Shai Shalev-Shwartz · 1935
Earlier work this paper cites.
Extensive games
H. W. Kuhn · 1950
Earlier work this paper cites.
Reduction of a game with complete memory to a matrix game
I. Romanovskii · 1962
Earlier work this paper cites.
Existence and uniqueness of equilibrium points for concave n-person games
J. B. Rosen · 1965
Earlier work this paper cites.
Goofspiel—the game of pure strategy
Sheldon M Ross · 1971
Earlier work this paper cites.
Introduction to optimization. optimization software
Boris T Polyak · 1987
Earlier work this paper cites.
Efficient computation of equilibria for extensive two-person games
Daphne Koller, Nimrod Megiddo, and Bernhard von Stengel · 1996
Earlier work this paper cites.
Calibrated learning and correlated equilibrium
Dean Foster and Rakesh Vohra · 1997
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Yoav Freund and Robert Schapire · 1999
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
Sergiu Hart and Andreu Mas-Colell · 2000
Earlier work this paper cites.
Uncoupled dynamics do not lead to Nash equilibrium
Sergiu Hart and Andreu Mas-Colell · 2003
Earlier work this paper cites.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Earlier work this paper cites.
Learning correlated equilibria in games with compact sets of strategies
Gilles Stoltz and Gábor Lugosi · 2007
Earlier work this paper cites.
Competing in the dark: An efficient algorithm for bandit linear optimization
Jacob Abernethy, Elad Hazan, and Alexander Rakhlin · 2008
Earlier work this paper cites.
Multiagent systems: Algorithmic, game-theoretic, and logical foundations
Yoav Shoham and Kevin Leyton-Brown · 2008
Earlier work this paper cites.
On the convergence of regret minimization dynamics in concave games
Eyal Even-Dar, Yishay Mansour, and Uri Nadav · 2009
Earlier work this paper cites.
Algorithms for abstracting and solving imperfect information games
Andrew Gilpin · 2009
Earlier work this paper cites.
Smoothing techniques for computing Nash equilibria of sequential games
Samid Hoda, Andrew Gilpin, Javier Peña, and Tuomas Sandholm · 2010
Cited alongside, same era.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2011
Cited alongside, same era.
Demand allocation games: Integrating discrete and continuous strategy spaces
Tobias Harks and Max Klimm · 2011
Cited alongside, same era.
Correlated equilibria in continuous games: Characterization and computation
Noah D. Stein, Pablo A. Parrilo, and Asuman E. Ozdaglar · 2011
Cited alongside, same era.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu · 2012
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Let’s be honest: An optimal no-regret framework for zero-sum games
Ehsan Asadi Kangarshahi, Ya-Ping Hsieh, Mehmet Fatih Sahin, and Volkan Cevher · 2018
Later among the works it cites.
More adaptive algorithms for adversarial bandits
Chen-Yu Wei and Haipeng Luo · 2018
Later among the works it cites.
Superhuman AI for multiplayer poker
Noam Brown and Tuomas Sandholm · 2019
Later among the works it cites.
Improved path-length regret bounds for bandits
Sébastien Bubeck, Yuanzhi Li, Haipeng Luo, and Chen-Yu Wei · 2019
Later among the works it cites.
Learning in games with continuous action sets and unknown payoff functions
Panayotis Mertikopoulos and Zhengyuan Zhou · 2019
Later among the works it cites.
Correlation in extensive-form games: Saddle-point formulation and benchmarks
Gabriele Farina, Chun Kai Ling, Fei Fang, and Tuomas Sandholm · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Revisiting frank-wolfe: Projection-free sparse convex optimization
Martin Jaggi · 2013
Cited alongside, same era.
Recency, records and recaps: Learning and non-equilibrium behavior in a simple decision problem
Drew Fudenberg and Alexander Peysakhovich · 2014
Cited alongside, same era.
Intrinsic robustness of the price of anarchy
Tim Roughgarden · 2015
Cited alongside, same era.
Heads-up limit hold’em poker is solved
Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin · 2015
Cited alongside, same era.
Fast convergence of regularized learning in games
Vasilis Syrgkanis, Alekh Agarwal, Haipeng Luo, and Robert E Schapire · 2015
Cited alongside, same era.
Local smoothness and the price of anarchy in splittable congestion games
Tim Roughgarden and Florian Schoppmann · 2015
Cited alongside, same era.
Hedging in games: Faster convergence of external and swap regrets
Xi Chen and Binghui Peng · 2020
Later among the works it cites.
Bias no more: high-probability data-dependent regret bounds for adversarial bandits and mdps
Chung-Wei Lee, Haipeng Luo, Chen-Yu Wei, and Mengxiao Zhang · 2020
Later among the works it cites.
A newton frank-wolfe method for constrained self-concordant minimization
Deyi Liu, Volkan Cevher, and Quoc Tran-Dinh · 2020
Later among the works it cites.
Near-optimal no-regret learning in general games
Constantinos Daskalakis, Maxwell Fishelson, and Noah Golowich · 2021
Later among the works it cites.
Georgios Piliouras, Ryann Sim, and Stratis Skoulakis · 2021
Later among the works it cites.
Adaptive learning in continuous games: Optimal regret bounds and convergence to nash equilibrium
Yu-Guan Hsieh, Kimon Antonakopoulos, and Panayotis Mertikopoulos · 2021
Later among the works it cites.
Fast rates for nonparametric online learning: from realizability to learning in games
Constantinos Daskalakis and Noah Golowich · 2022
Closest in time.
Georgios Piliouras, Ryann Sim, and Stratis Skoulakis · 2022
Closest in time.
Kernelized multiplicative weights for 0/1-polyhedral games: Bridging the gap between learning in extensive-form and normal-form games
Gabriele Farina, Chung-Wei Lee, Haipeng Luo, and Christian Kroer · 2022
Closest in time.
Adaptive bandit convex optimization with heterogeneous curvature
Haipeng Luo, Mengxiao Zhang, and Peng Zhao · 2022
Closest in time.
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games
Ioannis Anagnostides, Constantinos Daskalakis, Gabriele Farina, Maxwell Fishelson, Noah Golowich, and Tuomas Sandholm · 2022
Closest in time.