Maximal Objectives in the Multi-armed Bandit with Applications: ADA-ETC Has an Explicit Instance-Dependent Regret Bound and Worst-Case Regret O(K^{1/3}T^{2/3}√log K) for the Max ObjectiveResearch Paper
In the classical stochastic multi-armed bandit, a decision-maker pulls one of arms at each of times and is judged by the sum of all rewards collected. Ozbay and Kamble (arXiv:2006.06853v6, later in Management Science, 2024) study a different objective: the decision-maker is judged by the largest cumulative reward of a single arm at the end of the…