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 …

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 …

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 …

The problem of online matching with stochastic rewards is a generalization of the online
bipartite matching problem where each edge has a probability of success. When a match is …

Online matching markets (OMMs) are commonly used in today's world to pair agents from
two parties (whom we will call offline and online agents) for mutual benefit. However, studies …

Two-sided platforms rely on their recommendation algorithms to help their visitors
successfully find a match. However, on platforms such as VolunteerMatch-which has …