Reinforcement Learning for Markovian Bandits: Is Posterior Sampling more Scalable than Optimism? - Nicolas Gast; Bruno Gaujal; Kimang Khun (CoRR, 2021)

Computing Whittle (and Gittins) Index in Subcubic Time. - Nicolas Gast; Bruno Gaujal; Kimang Khun (CoRR, 2022)

Learning Algorithms for Markovian Bandits: Is Posterior Sampling more Scalable than Optimism? - Nicolas Gast; Bruno Gaujal; Kimang Khun (Trans. Mach. Learn. Res., 2022)

Algorithms for Markovian bandits: Indexability and Learning. (Des algorithmes pour les bandits markoviens: indexabilité et apprentissage). - Kimang Khun (2023)

Testing indexability and computing Whittle and Gittins index in subcubic time. - Nicolas Gast; Bruno Gaujal; Kimang Khun (Math. Methods Oper. Res., 2023)

What is an Optimal Policy in Time-Average MDP? - Nicolas Gast; Bruno Gaujal; Kimang Khun (SIGMETRICS Perform. Evaluation Rev., 2023)