research
∙
08/09/2023
MNL-Prophet: Sequential Assortment Selection under Uncertainty
Due to numerous applications in retail and (online) advertising the prob...
share
research
∙
06/01/2023
Last Switch Dependent Bandits with Monotone Payoff Functions
In a recent work, Laforgue et al. introduce the model of last switch dep...
research
∙
05/29/2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret
The stochastic multi-armed bandit setting has been recently studied in t...
research
∙
05/26/2022
Contextual Pandora's Box
Pandora's Box is a fundamental stochastic optimization problem, where th...
research
∙
11/12/2021
A Constant-Factor Approximation for Generalized Malleable Scheduling under M^♮-Concave Processing Speeds
In generalized malleable scheduling, jobs can be allocated and processed...
research
∙
11/11/2021
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds
Malleable scheduling is a model that captures the possibility of paralle...
research
∙
11/04/2021
Single-Sample Prophet Inequalities via Greedy-Ordered Selection
We study single-sample prophet inequalities (SSPIs), i.e., prophet inequ...
research
∙
05/22/2021
Combinatorial Blocking Bandits with Stochastic Delays
Recent work has considered natural variations of the multi-armed bandit ...
research
∙
03/24/2021
Single-Sample Prophet Inequalities Revisited
The study of the prophet inequality problem in the limited information r...
research
∙
01/30/2021
Recurrent Submodular Welfare and Matroid Blocking Bandits
A recent line of research focuses on the study of the stochastic multi-a...
research
∙
03/06/2020
Contextual Blocking Bandits
We study a novel variant of the multi-armed bandit problem, where at eac...
research
∙
03/26/2019
Malleable scheduling beyond identical machines
In malleable job scheduling, jobs can be executed simultaneously on mult...
research
∙
11/15/2018