Motivated by the applications of rental services in e-commerce, we consider revenue
maximization in online assortment of reusable resources for a stream of arriving consumers …

We consider the problem of online allocation (matching, budgeted allocations, and
assortments) of reusable resources where an adversarial sequence of resource requests is …

Network revenue management (NRM) describes a general online allocation problem in
which combinations of capacity-constrained resources are sold to a stream of arriving …

In several applications of real-time matching of demand to supply in online marketplaces,
the platform allows for some latency to batch the demand and improve the efficiency of the …

We study the classic online bipartite matching problem with a twist: offline nodes are
reusable any number of times. Every offline node i becomes available d steps after it was …

We study a general model on reusable resource allocation under model uncertainty. A
heterogeneous population of customers arrive at the decision maker's (DM's) platform …

Matching and pricing are two critical levers in two-sided marketplaces to connect demand
and supply. The platform can produce more efficient matching and pricing decisions by …

We study online weighted bipartite matching of reusable resources where an adversarial
sequence of requests for resources arrive over time. A resource that is matched is' used'for a …

We study the dynamic resource allocation problem in online service platforms featuring
reusable resources, waiting space, and heterogeneous demands and resources. The …

We study a two-stage online reusable resource allocation problem over T days involving
advance reservations and walk-ins. Each day begins with a reservation stage (Stage I) …