We study the two-stage vertex-weighted online bipartite matching problem of Feng,
Niazadeh, and Saberi (SODA '21) in a setting where the algorithm has access to a …

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

The paper studies the resource allocation problem for delivering on-site services in urban
areas. Requests for services are received spontaneously, with deliveries to be assigned …

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

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 …

Real-time decisions are usually irrevocable in many contexts of online decision-making.
One common practice is delaying real-time decisions so that the decision-maker can gather …

In this work, we revisit the multi-item order fulfillment model introduced by Jasin and Sinha
(2015). Specifically, we study a dynamic setting in which an e-commerce platform (or online …

Maintaining a maximum bipartite matching online while minimizing augmentations is a well
studied problem, motivated by content delivery, job scheduling, and hashing. A …

In this column, we will discuss some papers in online algorithms that appeared in 2021. As
usual, we make no claim at complete coverage here, and have instead made a selection. If …

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 …