Fetching the paper…
Reading the bibliography…
We study the problem of repeated play in a zero-sum game in which the payoff matrix may change, in a possibly adversarial fashion, on each round; we call these Online Matrix Games.
Die zerlegung eines intervalles in abzählbar viele kongruente teilmengen
J. Von Neumann · 1928
Earlier work this paper cites.
Non-cooperative games
J. Nash · 1951
Earlier work this paper cites.
Theory of games and economic behavior
O. Morgenstern and J. Von Neumann · 1953
Earlier work this paper cites.
Correlated equilibrium as an expression of bayesian rationality
R. J. Aumann · 1987
Earlier work this paper cites.
Stochastic approximation with input perturbation under dependent observation noises
O. Granichin · 1989
Earlier work this paper cites.
Markov games as a framework for multi-agent reinforcement learning
M. L. Littman · 1994
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 1995
Earlier work this paper cites.
Game theory, on-line prediction and boosting
Y. Freund and R. E. Schapire · 1996
Earlier work this paper cites.
A one-measurement form of simultaneous perturbation stochastic approximation
J. C. Spall · 1997
Earlier work this paper cites.
Nash convergence of gradient dynamics in general-sum games
S. Singh, M. Kearns, and Y. Mansour · 2000
Earlier work this paper cites.
Convergence of gradient dynamics with a variable learning rate
M. Bowling and M. Veloso · 2001
Earlier work this paper cites.
Efficient algorithms for universal portfolios
A. Kalai and S. Vempala · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Convex optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Convergence and no-regret in multiagent learning
M. Bowling · 2005
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
A. D. Flaxman, A. T. Kalai, and H. B. McMahan · 2005
Earlier work this paper cites.
Improved second-order bounds for prediction with expert advice
N. Cesa-Bianchi, Y. Mansour, and G. Stoltz · 2007
Earlier work this paper cites.
Awesome: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
V. Conitzer and T. Sandholm · 2007
Earlier work this paper cites.
Online learning: Theory, algorithms, and applications
S. Shalev-Shwartz and Y. Singer · 2007
Cited alongside, same era.
Competing in the dark: An efficient algorithm for bandit linear optimization
J. D. Abernethy, E. Hazan, and A. Rakhlin · 2009
Cited alongside, same era.
Robust optimization
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski · 2009
Cited alongside, same era.
Online learning and online convex optimization
S. Shalev-Shwartz et al · 2012
Cited alongside, same era.
The equivalence of linear programs and zero-sum games
I. Adler · 2013
Cited alongside, same era.
Bandits with knapsacks
A. Badanidiyuru, R. Kleinberg, and A. Slivkins · 2013
Cited alongside, same era.
A dynamic near-optimal algorithm for online linear programming
The role of flexibility in structure-based acceleration for online convex optimization
N. Ho-Nguyen and F. Kılınç-Karzan · 2016
Later among the works it cites.
Unrolled generative adversarial networks
L. Metz, B. Poole, D. Pfau, and J. Sohl-Dickstein · 2016
Later among the works it cites.
Improved techniques for training gans
T. Salimans, I. Goodfellow, W. Zaremba, V. Cheung, A. Radford, and X. Chen · 2016
Later among the works it cites.
On Frank-Wolfe and equilibrium computation
J. D. Abernethy and J.-K. Wang · 2017
Later among the works it cites.
M. Arjovsky, S. Chintala, and L. Bottou · 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…
S. Agrawal, Z. Wang, and Y. Ye · 2014
Cited alongside, same era.
The algorithmic foundations of differential privacy
C. Dwork, A. Roth, et al · 2014
Cited alongside, same era.
Generative adversarial nets
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio · 2014
Cited alongside, same era.
Adam: A method for stochastic optimization
D. P. Kingma and J. Ba · 2014
Cited alongside, same era.
Convex optimization: Algorithms and complexity
S. Bubeck et al · 2015
Cited alongside, same era.
Unsupervised and semi-supervised learning with categorical generative adversarial networks
J. T. Springenberg · 2015
Cited alongside, same era.
D. Berthelot, T. Schumm, and L. Metz · 2017
Later among the works it cites.
Improved training of wasserstein gans
I. Gulrajani, F. Ahmed, M. Arjovsky, V. Dumoulin, and A. C. Courville · 2017
Later among the works it cites.
Image-to-image translation with conditional adversarial networks
P. Isola, J.-Y. Zhu, T. Zhou, and A. A. Efros · 2017
Later among the works it cites.
On convergence and stability of gans
N. Kodali, J. Abernethy, J. Hays, and Z. Kira · 2017
Later among the works it cites.
Photo-realistic single image super-resolution using a generative adversarial network
C. Ledig, L. Theis, F. Huszár, J. Caballero, A. Cunningham, A. Acosta, A. P. Aitken, A. Tejani, J. Totz, Z. Wang, et al · 2017
Later among the works it cites.
Are gans created equal? a large-scale study
M. Lucic, K. Kurach, M. Michalski, S. Gelly, and O. Bousquet · 2017
Later among the works it cites.
Least squares generative adversarial networks
X. Mao, Q. Li, H. Xie, R. Y. Lau, Z. Wang, and S. P. Smolley · 2017
Later among the works it cites.
Faster rates for convex-concave games
J. Abernethy, K. A. Lai, K. Y. Levy, and J.-K. Wang · 2018
Later among the works it cites.
The mechanics of n-player differentiable games
D. Balduzzi, S. Racaniere, J. Martens, J. Foerster, K. Tuyls, and T. Graepel · 2018
Later among the works it cites.
Online network revenue management using thompson sampling
K. Ferreira, D. Simchi-Levi, and H. Wang · 2018
Later among the works it cites.
Adversarial bandits with knapsacks
N. Immorlica, K. A. Sankararaman, R. Schapire, and A. Slivkins · 2018
Later among the works it cites.
On the convergence of adam and beyond
S. J. Reddi, S. Kale, and S. Kumar · 2018
Later among the works it cites.
Competing against nash equilibria in adversarially changing zero-sum games
A. R. Cardoso, J. Abernethy, H. Wang, and H. Xu · 2019
Closest in time.