We study matching queues with abandonment. The simplest of these is the two-sided queue with servers on one side and customers on the other, both arriving dynamically over time and abandoning if not matched by the time their patience elapses. We identify non-asymptotic and universal scaling laws...

Traditional queuing theory assumes types are known or perfectly observed, and each type is typically put in its type-specific queue which is prioritized using some version of the celebrated c-mu rule; we call this type-based queueing. We study feature-based priority queuing where types are not...

We study how to optimally match agents in a dynamic market with heterogeneous match values. A network topology determines the feasible matches in the market. We consider networks that are two-sided when all matches include two agents, or acyclic otherwise. An inherent trade-off arises between...

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 form a match and the value generated from each match.A matching policy is hindsight optimal if the policy can (nearly)...

Several Emergency Medical Service (EMS) agencies across the US have demonstrated that the time spent by EDs on ambulance diversion can be reduced by implementing community-wide policies that restrict the duration and frequency of diversion episodes. However, the mechanisms through which these...