An ODE Model for Dynamic Matching in Heterogeneous Networks

We study the problem of dynamic matching in heterogeneous networks, where agents are subject to compatibility restrictions and stochastic arrival and departure times. In particular, we consider networks with one type of easy-to-match agents and multiple types of hard-to-match agents, each subject to...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-03
Hauptverfasser:	Dai, Xiaowu, He, Hengzhi
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applications programs Car pools Compatibility Differential equations Greedy algorithms Matching Networks Ordinary differential equations Transplantation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!