Tag
This paper resolves an open problem by showing that a single algorithm achieves optimal switching regret for every S against an oblivious adversary in multi-armed bandits.