J. Y. Audibert, S. Bubeck, and G. Lugosi, Regret in online combinatorial optimization Mathematics of Operations Research, 2014.

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, The Nonstochastic Multiarmed Bandit Problem, SIAM Journal on Computing, vol.32, issue.1, pp.48-77, 2002.
DOI : 10.1137/S0097539701398375

S. Bubeck, N. Cesa-bianchi, and S. M. Kakade, Towards minimax policies for online linear optimization with bandit feedback, COLT 2012, pp.1-14, 2012.

N. Cesa-bianchi and G. Lugosi, Combinatorial bandits, Journal of Computer and System Sciences, vol.78, issue.5, pp.1404-1422, 2012.
DOI : 10.1016/j.jcss.2012.01.001

V. Dani, T. P. Hayes, and S. Kakade, The price of bandit information for online optimization, NIPS-20, pp.345-352, 2008.

Y. Freund, R. Schapire, Y. Singer, and M. Warmuth, Using and combining predictors that specialize, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.334-343, 1997.
DOI : 10.1145/258533.258616

A. György, T. Linder, G. Lugosi, and G. Ottucsák, The on-line shortest path problem under partial monitoring, Journal of Machine Learning Research, vol.8, pp.2369-2403, 2007.

J. Hannan, Approximation to bayes risk in repeated play. Contributions to the theory of games, pp.97-139, 1957.

M. Hutter and J. Poland, Prediction with Expert Advice by Following the Perturbed Leader for General Weights, ALT, pp.279-293, 2004.
DOI : 10.1007/978-3-540-30215-5_22

D. Jannach, M. Zanker, A. Felfernig, F. , and G. , Recommender Systems: An Introduction, 2010.
DOI : 10.1017/CBO9780511763113

A. Kalai and S. Vempala, Efficient algorithms for online decision problems, Journal of Computer and System Sciences, vol.71, issue.3, pp.291-307, 2005.
DOI : 10.1016/j.jcss.2004.10.016

V. Kanade, H. B. Mcmahan, and B. Bryan, Sleeping experts and bandits with stochastic action availability and adversarial rewards, AISTATS 2009, pp.272-279, 2009.

V. Kanade and T. Steinke, Learning hurdles for sleeping experts, Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS 12), pp.11-18, 2012.

R. D. Kleinberg, A. Niculescu-mizil, and Y. Sharma, Regret bounds for sleeping experts and bandits, COLT 2008, pp.425-436, 2008.
DOI : 10.1007/s10994-010-5178-7

G. A. Koshevoy, Choice functions and abstract convex geometries, Mathematical Social Sciences, vol.38, issue.1, pp.35-44, 1999.
DOI : 10.1016/S0165-4896(98)00044-4

H. B. Mcmahan and A. Blum, Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary, COLT 2004, pp.109-123, 2004.
DOI : 10.1007/978-3-540-27819-1_8

G. Neu and G. Bartók, An Efficient Algorithm for Learning with Semi-bandit Feedback, ALT 2013, pp.234-248, 2013.
DOI : 10.1007/978-3-642-40935-6_17