[10] R. Degenne and W. M. Koolen. Pure exploration with multiple correct answers. In Advances in Neural Information Processing Systems (NeurIPS), 2019.
[11] R. Degenne, W. M. Koolen, and P. Menard. Non-asymptotic pure exploration by solving games. In Advances in Neural Information Processing Systems (NeurIPS), 2019.
[12] R. Degenne, H. Shao, and W. M. Koolen. Structure adaptive algorithms for stochastic bandits. In International Conference on Machine Learning (ICML), 2020.
[13] E. Even-Dar, S. Mannor, and Y. Mansour. Action Elimination and Stopping Conditions for the Multi-Armed Bandit and Reinforcement Learning Problems. Journal of Machine Learning Research, 7:1079-1105, 2006.
[14] V. Gabillon, M. Ghavamzadeh, and A. Lazaric. Best Arm Identification: A Unified Approach to Fixed Budget and Fixed Confidence. In Advances in Neural Information Processing Systems, 2012.
[15] A. Garivier and E. Kaufmann. Optimal best arm identification with fixed confidence. In Proceedings of the 29th Conference On Learning Theory, 2016.
[16] A. Garivier and E. Kaufmann. Non-asymptotic sequential tests for overlapping hypotheses and application to near optimal arm identification in bandit models. Sequential Analysis, 40(1): 61-96, 2021.
[17] K. Jamieson, M. Malloy, R. Nowak, and S. Bubeck. lil'UCB: an Optimal Exploration Algorithm for Multi-Armed Bandits. In Proceedings of the 27th Conference on Learning Theory, 2014.
[18] K. G. Jamieson and R. D. Nowak. Best-arm identification algorithms for multi-armed bandits in the fixed confidence setting. In Conference on Information Sciences and Systems (CISS), 2014.
[19] M. Jourdan and R. Degenne. Choosing answers in  $\varepsilon$ -best-answer identification for linear bandits. In International Conference on Machine Learning (ICML), 2022.
[20] M. Jourdan and R. Degenne. Non-asymptotic analysis of a ucb-based top two algorithm. arXiv preprint arXiv:2210.05431, 2022.
[21] M. Jourdan, R. Degenne, D. Baudry, R. De Heide, and E. Kaufmann. Top two algorithms revisited. Advances in Neural Information Processing Systems, 2022.
[22] M. Jourdan, R. Degenne, and E. Kaufmann. Dealing with unknown variances in best-arm identification. International Conference on Algorithmic Learning Theory, 2023.
[23] K.-W. Jun and R. Nowak. Anytime exploration for multi-armed bandits using confidence information. In International Conference on Machine Learning (ICML), 2016.
[24] S. Kalyanakrishnan, A. Tewari, P. Auer, and P. Stone. PAC subset selection in stochastic multi-armed bandits. In International Conference on Machine Learning (ICML), 2012.
[25] Z. Karnin, T. Koren, and O. Somekh. Almost optimal Exploration in multi-armed bandits. In International Conference on Machine Learning (ICML), 2013.
[26] J. Katz-Samuels and K. Jamieson. The true sample complexity of identifying good arms. In International Conference on Artificial Intelligence and Statistics, 2020.
[27] E. Kaufmann and W. M. Koolen. Mixture martingales revisited with applications to sequential tests and confidence intervals. Journal of Machine Learning Research, 22(246):1-44, 2021.
[28] J. Komiyama, T. Tsuchiya, and J. Honda. Minimax optimal algorithms for fixed-budget best arm identification. In Advances in Neural Information Processing Systems, 2022.
[29] T. Lattimore and C. Szepesvari. Bandit Algorithms. Cambridge University Press, 2019.
[30] A. Locatelli, M. Gutzeit, and A. Carpentier. An optimal algorithm for the thresholding bandit problem. In International Conference on Machine Learning (ICML), 2016.