arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.09757cs.LGstat.ML
收藏

异构网络中动态匹配的ODE模型

An ODE Model for Dynamic Matching in Heterogeneous Networks

University of California, Los Angeles(加州大学洛杉矶分校);Peking University(北京大学)

Xiaowu Dai, Hengzhi He

摘要:

我们研究了异构网络中的动态匹配问题,其中代理受到兼容性限制和随机到达和离开时间。特别是,我们认为网络与一种类型的易于匹配的代理和多种类型的难以匹配的代理,每个受自己的兼容性约束。这种设置出现在许多现实世界的应用中,包括肾脏交换计划和拼车平台。本文提出了一种新的动态匹配建模方法,即建立常微分方程模型,为评价各种匹配算法提供了一个新的视角。我们研究了两种算法,即贪婪和耐心的算法,这两种算法优先匹配兼容的难以匹配的代理商在异构网络中容易匹配的代理。我们的研究结果表明,匹配代理的冲突目标之间的权衡迅速和最佳的,提供洞察到现实世界的动态匹配系统的设计。我们提供了模拟和现实世界的案例研究,使用来自器官采购和移植网络的数据来验证理论预测。

英文摘要:

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 its own compatibility constraints. Such a setting arises in many real-world applications, including kidney exchange programs and carpooling platforms. We introduce a novel approach to modeling dynamic matching by establishing the ordinary differential equation (ODE) model, which offers a new perspective for evaluating various matching algorithms. We study two algorithms, namely the Greedy and Patient Algorithms, where both algorithms prioritize matching compatible hard-to-match agents over easy-to-match agents in heterogeneous networks. Our results demonstrate the trade-off between the conflicting goals of matching agents quickly and optimally, offering insights into the design of real-world dynamic matching systems. We provide simulations and a real-world case study using data from the Organ Procurement and Transplantation Network to validate theoretical predictions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑