Availability is all you need: achieving optimal regret with minimal information for dynamic matching

Süleyman Kerimov, Pengyu Qian, Mingwei Yang +1

We study a centralized discrete-time dynamic two-way matching model with finitely many agent types. Agents arrive stochastically over time and join their type-dedicated queues wait…