Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of
collaborators, is a central problem in economics. Indeed, the growing prevalence of …

Bipartite-matching markets pair agents on one side of a market with agents, items, or
contracts on the opposing side. Prior work addresses online bipartite-matching markets …

A central object in optimal stopping theory is the single-choice prophet inequality for
independent, identically distributed random variables: given a sequence of random …

Prophet inequalities are a useful tool for designing online allocation procedures and
comparing their performance to the optimal offline allocation. In the basic setting of k-unit …

Nonprofit crowdsourcing platforms such as food recovery organizations rely on volunteers to
perform time-sensitive tasks. Thus, their success crucially depends on efficient volunteer …

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 an online assortment optimization problem where we have n substitutable
products with fixed reusable capacities c 1,…, cn. In each period t, a user with some …

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 …