Motivated by real-world applications such as rental and cloud computing
...
When building datasets, one needs to invest time, money and energy to ei...
We study the classical Network Revenue Management (NRM) problem with
acc...
Motivated by hiring pipelines, we study two order selection problems in ...
We present new results for online contention resolution schemes for the
...
The design of online policies for stochastic matching and revenue manage...
We study the dynamic fulfillment problem in e-commerce, in which incomin...
We study the two-stage vertex-weighted online bipartite matching problem...
In this work, we study data-driven decision-making and depart from the
c...
Prophet inequalities consist of many beautiful statements that establish...
Matching markets involve heterogeneous agents (typically from two partie...
In the prophet secretary problem, n values are drawn independently from
...
Prophet inequalities are a useful tool for designing online allocation
p...
Matching is one of the most fundamental and broadly applicable problems
...
A classical question in economics is whether complex, randomized selling...
In typical online matching problems, the goal is to maximize the number ...
We improve the effectiveness of propagation- and linear-optimization-bas...
We introduce the assortment auction optimization problem, defined as fol...
We consider an assortment optimization problem where a customer chooses ...
We study an online knapsack problem where the items arrive sequentially ...
What fraction of the single item n buyers setting's expected optimal
rev...
We consider prophet inequalities in a setting where agents correspond to...
Motivated by the dynamic assortment offerings and item pricings occurrin...
This work is motivated by our collaboration with a large Consumer Packag...
In this paper we study the single-leg revenue management problem, with n...
We study a general problem of allocating limited resources to heterogene...