research
∙
03/15/2022
Online Task Assignment Problems with Reusable Resources
We study online task assignment problem with reusable resources, motivat...
share
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
∙
12/29/2019
Adaptive Algorithm for Finding Connected Dominating Sets in Uncertain Graphs
The problem of finding a minimum-weight connected dominating set (CDS) o...
research
∙
06/06/2018
Causal Bandits with Propagating Inference
Bandit is a framework for designing sequential experiments. In each expe...
research
∙
03/07/2018
