Fetching the paper…
Reading the bibliography…
This paper examines the long-run behavior of learning with bandit feedback in non-cooperative concave games.
A social equilibrium existence theorem
Debreu, Gerard. 1952 · 1952
Earlier work this paper cites.
On a stochastic approximation method
Chung, Kuo-Liang. 1954 · 1954
Earlier work this paper cites.
Existence and uniqueness of equilibrium points for concave N {N} -person games
Rosen, J. B. 1965 · 1965
Earlier work this paper cites.
Convex Analysis
Rockafellar, Ralph Tyrrell. 1970 · 1970
Earlier work this paper cites.
Note on existence and uniqueness of equilibrium points for concave N N -person games
Goodman, John C. 1980 · 1980
Earlier work this paper cites.
Martingale Limit Theory and Its Application
Hall, P., C. C. Heyde. 1980 · 1980
Earlier work this paper cites.
Problem Complexity and Method Efficiency in Optimization
Nemirovski, Arkadi Semen, David Berkovich Yudin. 1983 · 1983
Earlier work this paper cites.
Convergence analysis of a proximal-like minimization algorithm using Bregman functions
Chen, Gong, Marc Teboulle. 1993 · 1993
Earlier work this paper cites.
Competitive routing in multi-user communication networks
Orda, Ariel, Raphael Rom, Nahum Shimkin. 1993 · 1993
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, Peter, Nicolò Cesa-Bianchi, Yoav Freund, Robert E. Schapire. 1995 · 1995
Earlier work this paper cites.
A one-measurement form of simultaneous perturbation stochastic approximation
Spall, James C. 1997 · 1997
Earlier work this paper cites.
Dynamics of stochastic approximation algorithms
Benaïm, Michel. 1999 · 1999
Earlier work this paper cites.
Adaptive game playing using multiplicative weights
Freund, Yoav, Robert E. Schapire. 1999 · 1999
Earlier work this paper cites.
Quasi-Fejérian analysis of some optimization algorithms
Combettes, Patrick L. 2001 · 2001
Cited alongside, same era.
Introduction to Smooth Manifolds
Lee, John M. 2003 · 2003
Cited alongside, same era.
Online convex programming and generalized infinitesimal gradient ascent
Zinkevich, Martin. 2003 · 2003
Cited alongside, same era.
Nearly tight bounds for the continuum-armed bandit problem
Kleinberg, Robert D. 2004 · 2004
Cited alongside, same era.
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Yurii. 2004 · 2004
Cited alongside, same era.
Online convex optimization in the bandit setting: gradient descent without a gradient
Flaxman, Abraham D., Adam Tauman Kalai, H. Brendan McMahan. 2005 · 2005
Cited alongside, same era.
Stochastic fictitious play with continuous action sets
Perkins, Steven, David S. Leslie. 2014 · 2014
Later among the works it cites.
Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
Combettes, Patrick L., Jean-Christophe Pesquet. 2015 · 2015
Later among the works it cites.
Fast convergence of regularized learning in games
Syrgkanis, Vasilis, Alekh Agarwal, Haipeng Luo, Robert E. Schapire. 2015 · 2015
Later among the works it cites.
Learning in games: Robustness of fast convergence
Foster, Dylan J., Thodoris Lykouris, Kathrik Sridharan, Éva Tardos. 2016 · 2016
Later among the works it cites.
Finite composite games: Equilibria and dynamics
Sorin, Sylvain, Cheng Wan. 2016 · 2016
Later among the works it cites.
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, Heinz H., Patrick L. Combettes. 2017 · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust stochastic approximation approach to stochastic programming
Nemirovski, Arkadi Semen, Anatoli Juditsky, Guangui (George) Lan, Alexander Shapiro. 2009 · 2009
Cited alongside, same era.
Primal-dual subgradient methods for convex problems
Nesterov, Yurii. 2009 · 2009
Cited alongside, same era.
Optimal algorithms for online convex optimization with multi-point bandit feedback
Agarwal, Alekh, O. Dekel, L. Xiao. 2010 · 2010
Cited alongside, same era.
The multiplicative weights update method: A meta-algorithm and applications
Arora, Sanjeev, Elad Hazan, Satyen Kale. 2012 · 2012
Cited alongside, same era.
Stochastic first- and zeroth-order methods for nonconvex stochastic programming
Ghadimi, Saeed, Guanghui Lan. 2013 · 2013
Cited alongside, same era.
On the complexity of bandit and derivative-free stochastic convex optimization
Shamir, Ohad. 2013 · 2013
Cited alongside, same era.
Learning with bandit feedback in potential games
Cohen, Johanne, Amélie Héliou, Panayotis Mertikopoulos. 2017 · 2017
Later among the works it cites.
Distributed stochastic optimization via matrix exponential learning
Mertikopoulos, Panayotis, E. Veronica Belmega, Romain Negrel, Luca Sanguinetti. 2017 · 2017
Later among the works it cites.
Multiplicative weights update with constant step-size in congestion games: Convergence, limit cycles and chaos
Palaiopanos, Gerasimos, Ioannis Panageas, Georgios Piliouras. 2017 · 2017
Later among the works it cites.
Mixed-strategy learning with continuous action sets
Perkins, Steven, Panayotis Mertikopoulos, David S. Leslie. 2017 · 2017
Later among the works it cites.
Learning with minimal information in continuous games
Bervoets, Sebastian, Mario Bravo, Mathieu Faure. 2018 · 2018
Closest in time.
Learning in games with continuous action sets and unknown payoff functions
Mertikopoulos, Panayotis, Zhengyuan Zhou. 2018 · 2018
Closest in time.