Fetching the paper…
Reading the bibliography…
In the literature on game-theoretic equilibrium finding, focus has mainly been on solving a single game in isolation.
A model of general economic equilibrium
J. V. Neumann · 1945
Earlier work this paper cites.
An iterative method of solving a game
Julia Robinson · 1951
Earlier work this paper cites.
Stochastic games
L. S. Shapley · 1953
Earlier work this paper cites.
An analog of the minimax theorem for vector payoffs
David Blackwell · 1956
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.
Subjectivity and correlation in randomized strategies
Robert J. Aumann · 1974
Earlier work this paper cites.
The extragradient method for finding saddle points and other problems
Galina M Korpelevich · 1976
Earlier work this paper cites.
Regret-based pruning in extensive-form games
Noam Brown and Tuomas Sandholm · 1980
Earlier work this paper cites.
Stability and Perfection of Nash Equilibria
Eric van Damme · 1987
Earlier work this paper cites.
Existence of correlated equilibria
Sergiu Hart and David Schmeidler · 1989
Earlier work this paper cites.
Rationalizability, learning, and equilibrium in games with strategic complementarities
Paul Milgrom and John Roberts · 1990
Earlier work this paper cites.
The complexity of two-person zero-sum games in extensive form
Daphne Koller and Nimrod Megiddo · 1992
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Earlier work this paper cites.
Learning to learn
Sebastian Thrun and Lorien Pratt · 1998
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.
On the global convergence of stochastic fictitious play
Josef Hofbauer and William H. Sandholm · 2002
Earlier work this paper cites.
Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions
Adrian Vetta · 2002
Earlier work this paper cites.
Proximal methods for cohypomonotone operators
Patrick L. Combettes and Teemu Pennanen · 2004
Earlier work this paper cites.
Efficiency loss in a network resource allocation game
Ramesh Johari and John N. Tsitsiklis · 2004
Earlier work this paper cites.
Clustering with bregman divergences
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, and Joydeep Ghosh · 2005
Earlier work this paper cites.
The price of anarchy of finite congestion games
George Christodoulou and Elias Koutsoupias · 2005
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolo Cesa-Bianchi and Gabor Lugosi · 2006
Earlier work this paper cites.
From external to internal regret
Avrim Blum and Yishay Mansour · 2007
Earlier work this paper cites.
Improved second-order bounds for prediction with expert advice
Nicolò Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz · 2007
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
Settling the complexity of computing two-player nash equilibria
Xi Chen, Xiaotie Deng, and Shang-Hua Teng · 2009
Earlier work this paper cites.
The complexity of computing a nash equilibrium
Constantinos Daskalakis, Paul W. Goldberg, and Christos H. Papadimitriou · 2009
Earlier work this paper cites.
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract
Robert Kleinberg, Georgios Piliouras, and Éva Tardos · 2009
Earlier work this paper cites.
Extracting certainty from uncertainty: regret bounded by variation in costs
Elad Hazan and Satyen Kale · 2010
Earlier work this paper cites.
Price of anarchy for greedy auctions
Brendan Lucier and Allan Borodin · 2010
Earlier work this paper cites.
Distributed algorithms via gradient descent for fisher markets
Benjamin E. Birnbaum, Nikhil R. Devanur, and Lin Xiao · 2011
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
John C. Duchi, Elad Hazan, and Yoram Singer · 2011
Earlier work this paper cites.
Better algorithms for benign bandits
Elad Hazan and Satyen Kale · 2011
Earlier work this paper cites.
Competitive routing over time
Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, and Shang-Hua Teng · 2011
Earlier work this paper cites.
Follow-the-regularized-leader and mirror descent: Equivalence theorems and L1 regularization
H. Brendan McMahan · 2011
Earlier work this paper cites.
Online optimization with gradual variations
Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu · 2012
Earlier work this paper cites.
First-order algorithm with 𝒪 ( ln ( 1 / ϵ ) ) \mathcal{O}(\ln(1/\epsilon)) convergence for ϵ \epsilon -equilibrium in two-person zero-sum games
Andrew Gilpin, Javier Peña, and Tuomas Sandholm · 2012
Earlier work this paper cites.
The price of routing unsplittable flow
Baruch Awerbuch, Yossi Azar, and Amir Epstein · 2013
Cited alongside, same era.
Dynamics in near-potential games
Ozan Candogan, Asuman E. Ozdaglar, and Pablo A. Parrilo · 2013
Cited alongside, same era.
Online learning with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Alexander Rakhlin and Karthik Sridharan · 2013
Cited alongside, same era.
Composable and efficient mechanisms
Vasilis Syrgkanis and Éva Tardos · 2013
Cited alongside, same era.
Regret transfer and parameter optimization
Noam Brown and Tuomas Sandholm · 2014
Cited alongside, same era.
Dynamic network congestion games
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur · 2020
Later among the works it cites.
Independent policy gradient methods for competitive reinforcement learning
Constantinos Daskalakis, Dylan J. Foster, and Noah Golowich · 2020
Later among the works it cites.
Tight last-iterate convergence rates for no-regret learning in multi-player games
Noah Golowich, Sarath Pattathil, and Constantinos Daskalakis · 2020
Later among the works it cites.
Last iterate is slower than averaged iterate in smooth convex-concave saddle point problems
Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, and Asuman E. Ozdaglar · 2020
Later among the works it cites.
Dif-maml: Decentralized multi-agent meta-learning
Mert Kayaalp, Stefan Vlaski, and Ali H. Sayed · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Oskari Tammelin · 2014
Cited alongside, same era.
Efficient representations for lifelong learning and autoencoding
Maria-Florina Balcan, Avrim Blum, and Santosh S. Vempala · 2015
Cited alongside, same era.
Simultaneous abstraction and equilibrium finding in games
Noam Brown and Tuomas Sandholm · 2015
Cited alongside, same era.
Near-optimal no-regret algorithms for zero-sum games
Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2015
Cited alongside, same era.
No-regret learning in bayesian games
Jason D. Hartline, Vasilis Syrgkanis, and Éva Tardos · 2015
Cited alongside, same era.
Achieving all with no parameters: Adanormalhedge
Haipeng Luo and Robert E. Schapire · 2015
Cited alongside, same era.
Michael Mitzenmacher and Sergei Vassilvitskii · 2020
Later among the works it cites.
A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach
Aryan Mokhtari, Asuman E. Ozdaglar, and Sarath Pattathil · 2020
Later among the works it cites.
Follow the perturbed leader: Optimism and fast parallel algorithms for smooth minimax games
Arun Sai Suggala and Praneeth Netrapalli · 2020
Later among the works it cites.
On the theory of policy gradient methods: Optimality, approximation, and distribution shift
Alekh Agarwal, Sham M. Kakade, Jason D. Lee, and Gaurav Mahajan · 2021
Later among the works it cites.
The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities
Waïss Azizian, Franck Iutzeler, Jérôme Malick, and Panayotis Mertikopoulos · 2021
Later among the works it cites.
Generalized monotone operators and their averaged resolvents
Heinz H. Bauschke, Walaa M. Moursi, and Xianfu Wang · 2021
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.
Efficient methods for structured nonconvex-nonconcave min-max optimization
Jelena Diakonikolas, Constantinos Daskalakis, and Michael I. Jordan · 2021
Later among the works it cites.
Global convergence to local minmax equilibrium in classes of nonconvex zero-sum games
Tanner Fiez, Lillian J. Ratliff, Eric Mazumdar, Evan Faulkner, and Adhyyan Narang · 2021
Later among the works it cites.
Increasing iterate averaging for solving saddle-point problems
Yuan Gao, Christian Kroer, and Donald Goldfarb · 2021
Later among the works it cites.
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
Angeliki Giannou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, and Panayotis Mertikopoulos · 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.
Distributed meta-learning with networked agents
Mert Kayaalp, Stefan Vlaski, and Ali H Sayed · 2021
Later among the works it cites.
Georgios Piliouras, Ryann Sim, and Stratis Skoulakis · 2021
Later among the works it cites.
No-regret dynamics in the fenchel game: A unified framework for algorithmic convex optimization
Jun-Kun Wang, Jacob D. Abernethy, and Kfir Y. Levy · 2021
Later among the works it cites.
Linear last-iterate convergence in constrained saddle-point optimization
Chen-Yu Wei, Chung-Wei Lee, Mengxiao Zhang, and Haipeng Luo · 2021
Later among the works it cites.
On last-iterate convergence beyond zero-sum games
Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, and Tuomas Sandholm · 2022
Closest in time.
Meta-learning adversarial bandits
Maria-Florina Balcan, Keegan Harris, Mikhail Khodak, and Zhiwei Steven Wu · 2022
Closest in time.
Smoothed online learning is as easy as statistical learning
Adam Block, Yuval Dagan, Noah Golowich, and Alexander Rakhlin · 2022
Closest in time.
Accelerated single-call methods for constrained min-max optimization
Yang Cai and Weiqiang Zheng · 2022
Closest in time.
Memory bounds for continual learning
Xi Chen, Christos H. Papadimitriou, and Binghui Peng · 2022
Closest in time.
Fast rates for nonparametric online learning: from realizability to learning in games
Constantinos Daskalakis and Noah Golowich · 2022
Closest in time.
Fast payoff matrix sparsification techniques for structured extensive-form games
Gabriele Farina and Tuomas Sandholm · 2022
Closest in time.
Near-optimal no-regret learning for general convex games
Gabriele Farina, Ioannis Anagnostides, Haipeng Luo, Chung-Wei Lee, Christian Kroer, and Tuomas Sandholm · 2022
Closest in time.
Oracle-efficient online learning for beyond worst-case adversaries
Nika Haghtalab, Yanjun Han, Abhishek Shetty, and Kunhe Yang · 2022
Closest in time.
Yu-Guan Hsieh, Kimon Antonakopoulos, Volkan Cevher, and Panayotis Mertikopoulos · 2022
Closest in time.
Learning predictions for algorithms with predictions
Mikhail Khodak, Maria-Florina Balcan, Ameet Talwalkar, and Sergei Vassilvitskii · 2022
Closest in time.
Global convergence of multi-agent policy gradient in markov potential games
Stefanos Leonardos, Will Overman, Ioannis Panageas, and Georgios Piliouras · 2022
Closest in time.
Learning to collaborate in decentralized learning of personalized models
Shuangtong Li, Tianyi Zhou, Xinmei Tian, and Dacheng Tao · 2022
Closest in time.
Online meta-learning in adversarial multi-armed bandits
Ilya Osadchiy, Kfir Y Levy, and Ron Meir · 2022
Closest in time.
Alternating mirror descent for constrained min-max games
Andre Wibisono, Molei Tao, and Georgios Piliouras · 2022
Closest in time.
Equilibrium finding in normal-form games via greedy regret minimization
Hugh Zhang, Adam Lerer, and Noam Brown · 2022
Closest in time.
No-regret learning in time-varying zero-sum games
Mengxiao Zhang, Peng Zhao, Haipeng Luo, and Zhi-Hua Zhou · 2022
Closest in time.