arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.09678eess.SYcs.AIcs.DMcs.SIcs.SYmath.OC
收藏

传染病控制中的序贯动态资源分配

Sequential Dynamic Resource Allocation for Epidemic Control

CMLA – ENS Paris-Saclay(巴黎-萨克雷高等师范学校应用数学实验室)

Mathilde Fekom, Nicolas Vayatis, Argyris Kalogeratos

摘要:

在动态资源分配(Dynamic Resource Allocation,简称DP)模型下,管理员的任务是将有限的资源预算动态地分配给网络的节点,以减少扩散过程(diffusion process,简称DP)(例如流行病)。标准的TCP/IP协议假定管理员始终拥有完整的信息,并且可以即时访问整个网络。为了使这种策略更接近现实生活中的约束,我们首先提出了限制性的网络模型扩展,在每个干预轮,访问仅限于一小部分的网络节点,称为样本。然后,启发顺序选择问题,如著名的秘书问题,我们提出了顺序选择(SDRA)模型。我们的模型引入了一个连续的方面,在决策过程中的每一轮的样本,提供了一个全新的视角,动态DP控制。最后,我们将几种顺序选择算法纳入SDRA控制策略,并比较它们在SIS流行病模拟中的性能。

英文摘要:

Under the Dynamic Resource Allocation (DRA) model, an administrator has the mission to allocate dynamically a limited budget of resources to the nodes of a network in order to reduce a diffusion process (DP) (e.g. an epidemic). The standard DRA assumes that the administrator has constantly full information and instantaneous access to the entire network. Towards bringing such strategies closer to real-life constraints, we first present the Restricted DRA model extension where, at each intervention round, the access is restricted to only a fraction of the network nodes, called sample. Then, inspired by sequential selection problems such as the well-known Secretary Problem, we propose the Sequential DRA (SDRA) model. Our model introduces a sequential aspect in the decision process over the sample of each round, offering a completely new perspective to the dynamic DP control. Finally, we incorporate several sequential selection algorithms to SDRA control strategies and compare their performance in SIS epidemic simulations.

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

↑