J. Audibert, S. Bubeck, and G. Lugosi, Regret in online combinatorial optimization, Mathematics of Operations Research, vol.39, pp.31-45, 2014.

P. Auer, N. Cesa-bianchi, and P. Fischer, Finite-time analysis of the multiarmed bandit problem, Machine Learning, vol.47, pp.235-256, 2002.

F. Bach, Learning with Submodular Functions: A Convex Optimization Perspective, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00645271

R. A. Brualdi, Comments on bases in dependence structures, Bulletin of the Australian Mathematical Society, vol.1, issue.2, pp.161-167, 1969.

N. Cesa-bianchi and G. Lugosi, Combinatorial bandits, Journal of Computer and System Sciences, vol.78, pp.1404-1422, 2012.

W. Chen, Y. Wang, and Y. Yuan, Combinatorial Multi-Armed Bandit: General Framework and Applications, International Conference on Machine Learning, pp.151-159, 2013.

W. Chen, Y. Wang, Y. Yuan, W. , and Q. , Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms, 2014.

R. Combes, M. S. Shahi, A. Proutiere, and O. , Combinatorial bandits revisited, Advances in Neural Information Processing Systems, pp.2116-2124, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257796

R. Degenne and V. Perchet, Combinatorial semi-bandit with known covariance, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01408534

W. Ding, T. Qin, X. Zhang, and T. Liu, Multi-Armed Bandit with Budget Constraint and Variable Costs, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013.

J. Edmonds, Matroids and the Greedy Algorithm, Mathematical Programming, vol.1, issue.1, pp.127-136, 1971.

J. Edmonds and D. Fulkerson, Transversals and matroid partition, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.69, issue.3, pp.147-153, 1965.

Y. Filmus and J. Ward, A tight combinatorial algorithm for submodular maximization subject to a matroid constraint, Proceedings -Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp.659-668, 2012.

S. Fujishige, Submodular functions and optimization. Annals of discrete mathematics, 2005.

Y. Gai, B. Krishnamachari, and R. Jain, Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations, Transactions on Networking, vol.20, issue.5, pp.1466-1478, 2012.

S. He, J. Zhang, and S. Zhang, Polymatroid Optimization, Submodularity, and Joint Replenishment Games, Operations Research, vol.60, issue.1, pp.128-137, 2012.

K. Jun, A. Bhargava, R. Nowak, and R. Willett, Scalable Generalized Linear Bandits: Online Computation and Hashing, 2017.

W. Koolen, M. K. Warmuth, and J. Kivinen, Hedging structured concepts, COLT, vol.118653, pp.93-105, 2010.

A. Krause and D. Golovin, Submodular function maximization, Tractability, vol.9781107025, pp.71-104, 2011.

B. Kveton, Z. Wen, A. Ashkan, H. Eydgahi, and B. Eriksson, Matroid bandits: Fast combinatorial optimization with learning, Uncertainty in Artificial Intelligence, 2014.