908 citations · 918 across the 17 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.LG2021★ 1 cited
Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
Jung-hun Kim, Milan Vojnovic
We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments. In this scenario, jobs incur holding costs…
stat.ML2021★ 1 cited
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…
cs.LG2021
Scheduling Jobs with Stochastic Holding Costs
Dabeen Lee, Milan Vojnovic
We study a single-server scheduling problem for the objective of minimizing the expected cumulative holding cost incurred by jobs, where parameters defining stochastic job holding…