[13] Thibaut Cuvelier, Richard Combes, and Eric Gourdin. "Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits". In: Proc. ACM Meas. Anal. Comput. Syst. (2021).
[14] Rina Dechter. “Bucket Elimination: A Unifying Framework for Reasoning”. In: Artif. Intell. (1999).
[15] Rina Dechter, Natalia Flerova, and Radu Marinescu. "Search Algorithms for M Best Solutions for Graphical Models". In: AAAI Press, 2012.
[16] Rémy Degenne and Vianney Perchet. "Combinatorial semi-bandit with known covariance". In: Proc. of NeurIPS. 2016.
[17] Steven Diamond and Stephen Boyd. "CVXPY: A Python-embedded modeling language for convex optimization". In: JMLR (2016).
[18] Todd L Graves and Tze Leung Lai. "Asymptotically efficient adaptive choice of control laws incontrolled markov chains". In: SIAM journal on control and optimization (1997).
[19] Carlos Guestrin, Daphne Koller, and Ronald Parr. "Max-norm Projections for Factored MDPs". In: Proc. of IJCAI. 2001.
[20] Carlos Guestrin et al. "Efficient Solution Algorithms for Factored MDPs". In: J. Artif. Int. Res. (2003).
[21] Botao Hao, Tor Lattimore, and Csaba Szepesvári. “Adaptive Exploration in Linear Contextual Bandit”. In: Proc. of AISTATS. 2020.
[22] Yassir Jedra and Alexandre Proutiere. "Optimal Best-arm Identification in Linear Bandits". In: Proc. of NeurIPS. 2020.
[23] Emilie Kaufmann. "Contributions to the Optimal Solution of Several Bandit Problems". Habilitation à diriger des recherches. Université de Lille, Nov. 2020.
[24] Branislav Kveton et al. "Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits". In: PLMR. Proceedings of Machine Learning Research. PMLR, 2015.
[25] Tze Leung Lai and Herbert Robbins. "Asymptotically efficient adaptive allocation rules". In: Advances in applied mathematics (1985).
[26] E.L. Lawler. "A procedure for computing the k best solutions to discrete optimization problems and its application to the shortest path problem". In: Management Science (1972).
[27] Marloes Maathuis et al. Handbook of Graphical Models. CRC Press, Inc., 2018.
[28] Stefan Magureanu, Richard Combes, and Alexandre Proutiere. "Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms". In: Proc. of COLT. 2014.
[29] P.J. Modi. "Distributed constraint optimization for multiagent". PhD thesis. University of Southern California, 2003.
[30] D. Nilsson. "An Efficient Algorithm for Finding the M Most Probable Configurations in Probabilistic Expert Systems". In: Statistics and Computing (1998).
[31] Pierre Perrault et al. "Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits". In: Proc. of NeurIPS. 2020.
[32] Theodore Rappaport. Wireless Communications: Principles and Practice. Prentice Hall, 2001.
[33] James Renegar. “A polynomial-time algorithm, based on Newton's method, for linear programming”. In: Mathematical Programming (1988).
[34] David Sontag and Tommi Jaakkola. "On Iteratively Constraining the Marginal Polytope for Approximate Inference and MAP". In: Semantic Scholar (2007).
[35] Ruben Stranders et al. "DCOPs and bandits: exploration and exploitation in decentralised coordination". In: Proc. of AAMAS. 2012.
[36] Filippo Vannella, Alexandre Proutiere, and Jaeseong Jeong. "Best Arm Identification in Multi-Agent Multi-Armed Bandits". In: Proc. of ICML. 2023.
[37] Timothy Verstraeten et al. "Multi-Agent Thompson Sampling for Bandit Applications with Sparse Neighbourhood Structures". In: Scientific Reports (2020).
[38] Andrew Wagenmaker, Julian Katz-Samuels, and Kevin Jamieson. Experimental Design for Regret Minimization in Linear Bandits. 2020.
[39] Martin Wainwright and Michael Jordan. Graphical Models, Exponential Families, and Variational Inference. Now Publishers Inc., 2008.
[40] Siwei Wang and Wei Chen. "Thompson Sampling for Combinatorial Semi-Bandits". In: Proc. of ICML. 2018.