research
∙
02/24/2023
Best-of-Three-Worlds Linear Bandit Algorithm with Variance-Adaptive Regret Bounds
This paper proposes a linear bandit algorithm that is adaptive to enviro...
share
research
∙
03/15/2022
Online Task Assignment Problems with Reusable Resources
We study online task assignment problem with reusable resources, motivat...
research
∙
01/20/2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
The contextual combinatorial semi-bandit problem with linear payoff func...
research
∙
09/05/2019