In a ride-sharing system, arriving customers must be matched with available drivers. These
decisions affect the overall number of customers matched, because they impact whether …

In recent years, a number of models involving different compatibilities between jobs and
servers in queueing systems, or between agents and resources in matching systems, have …

Abstract Problem Definition: Motivated by ride-hailing platforms such as Uber, Lyft and Didi,
we study the problem of matching riders with self-interested drivers over a spatial network …

Female user (driver and rider) safety is a serious concern for ride‐hailing platforms. One way
to address this concern is to migrate from the traditional “pooling” system that matches riders …

Motivated by centralized matching markets, we study an online stochastic matching problem
on edge-weighted graphs, where the agents' arrivals and abandonments are stochastic and …

This paper introduces a stylized model to capture distinctive features of waiting list allocation
mechanisms. First, agents choose among items with associated expected wait times …

We consider the optimal control of matching queues with random arrivals. In this model,
items arrive to dedicated queues, and wait to be matched with items from other (possibly …

Motivated by queues with multitype servers and multitype customers, we consider an infinite
sequence of items of types 𝒞={c 1,…, c I}, and another infinite sequence of items of types …

We study dynamic matching policies in a stochastic marketplace for barter, with agents
arriving over time. Each agent is endowed with an item and is interested in an item …

Service platforms must determine rules for matching heterogeneous demand (customers)
and supply (workers) that arrive randomly over time and may be lost if forced to wait too long …