Learning in Games: Robustness of Fast Convergence

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.

Adaptive and self-confident on-line learning algorithms

Peter Auer, Nicolo Cesa-Bianchi, and Claudio Gentile · 2002

Earlier work this paper cites.

How bad is selfish routing?

Tim Roughgarden and Eva Tardos · 2002

Earlier work this paper cites.

How to better use expert advice

Rani Yaroshinsky, Ran El-Yaniv, and Steven S. Seiden · 2004

Earlier work this paper cites.

The price of anarchy of finite congestion games

Giorgos Christodoulou and Elias Koutsoupias · 2005

Earlier work this paper cites.

Incomplete information and internal regret in prediction of individual sequences

Gilles Stoltz · 2005

Earlier work this paper cites.

Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring

Chamy Allenberg, Peter Auer, László Györfi, and György Ottucsák · 2006

Earlier work this paper cites.

Prediction, Learning, and Games

Nicolo Cesa-Bianchi and Gabor Lugosi · 2006

Earlier work this paper cites.

Improved second-order bounds for prediction with expert advice

Nicolo Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz · 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.

High-probability regret bounds for bandit online linear optimization

Peter L Bartlett, Varsha Dani, Thomas Hayes, Sham Kakade, Alexander Rakhlin, and Ambuj Tewari · 2008

Cited alongside, same era.

Efficient learning algorithms for changing environments

Elad Hazan and C. Seshadhri · 2009

Cited alongside, same era.

Playing games with approximation algorithms

Sham M. Kakade, Adam Tauman Kalai, and Katrina Ligett · 2009

Cited alongside, same era.

Worst-case equilibria

Elias Koutsoupias and Christos Papadimitriou · 2009

Cited alongside, same era.

Regret bounds and minimax policies under partial monitoring

Jean-Yves Audibert and Sébastien Bubeck · 2010

Cited alongside, same era.

Extracting certainty from uncertainty: Regret bounded by variation in costs

Elad Hazan and Satyen Kale · 2010

Cited alongside, same era.

Near-optimal no-regret algorithms for zero-sum games

Constantinos Daskalakis, Alan Deckelbaum, and Anthony Kim · 2015

Later among the works it cites.

Adaptive online learning

Dylan J Foster, Alexander Rakhlin, and Karthik Sridharan · 2015

Later among the works it cites.

Second-order quantile methods for experts and combinatorial games

Wouter M Koolen and Tim Van Erven · 2015

Later among the works it cites.

Achieving all with no parameters: Adanormalhedge

Haipeng Luo and Robert E Schapire · 2015

Later among the works it cites.

First-order regret bounds for combinatorial semi-bandits

Gergely Neu · 2015

Later among the works it cites.

Intrinsic robustness of the price of anarchy

Tim Roughgarden · 2015

Later among the works it cites.