Dynamic Matching Problems with Application to Kidney Allocation

Project: Research project

Project Details


The project investigates a dynamic queueing networks, where agents arrive and are matched immediately or placed in a queue (waiting list) for a potentially better match. The project will rigorously study dynamic matching policies that perform well in real networks by (1) identifying the essential ingredients of good policies and determining the degrees of freedom in designing implementable exchange protocols; (2) understanding the effect of abandonments and change in condition over time; and (3) testing potential protocols with transaction-level data from two American exchange platforms. Mathematical models, to remain tractable, cannot fully capture all sources of friction.
Effective start/end date1/1/217/31/23


  • National Science Foundation (CMMI 2137286)