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 …

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 …

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 …

We study centralized dynamic matching markets with finitely many agent types and
heterogeneous match values. A network topology describes the pairs of agent types that can …

We consider three parallel service models in which customers of several types are served by
several types of servers subject to a bipartite compatibility graph, and the service policy is …

We consider a multiclass multiserver queueing system and study the problem of designing
an optimal matching topology (or service compatibility structure) between customer classes …

Motivated by growing applications in two-sided markets, we study a parallel matching queue
with reneging. Demand and supply units arrive to the system and are matched in an FCFS …

We introduce and study a new model that we call the matching model. Items arrive one by
one in a buffer and depart from it as soon as possible but by pairs. The items of a departing …

We consider a stochastic matching model with a general compatibility graph, as introduced
by Mairesse and Moyal (2016). We show that the natural necessary condition of stability of …

We consider a matching system with random arrivals of items of different types. The items
wait in queues—one per item type—until they are “matched.” Each matching requires certain …