论文标题

通过顺序资源分配动态流行病控制

Dynamic Epidemic Control via Sequential Resource Allocation

论文作者

Fekom, Mathilde, Vayatis, Nicolas, Kalogeratos, Argyris

论文摘要

在动态资源分配(DRA)问题中,管理员必须为网络节点分配有限的资源,以减少扩散过程(DP)(例如流行病)。在本文中,我们提出了一个多轮动态控制框架,我们通过两个派生的模型(限制性DRA和顺序DRA(RDRA,SDRA))实现,该模型允许限制信息并访问整个网络,与标准的完整信息和全磁模型相反。在每个干预回合中,管理员只能访问 - 对于前者,后者的顺序同时访问了网络节点的一小部分。决策过程中的连续方面为动态DP控制提供了全新的视角,使这项工作成为第一个将动态控制问题作为一系列顺序选择问题的作品。通过深入的SIS流行模拟,我们将多轮方法的性能与其他资源分配策略以及生成的其他资源分配策略以及几种顺序选择算法进行了比较。结果提供了有关拟议框架在现实生活问题上的效率和适用性的证据。

In the Dynamic Resource Allocation (DRA) problem, an administrator has to allocate a limited amount of resources to the nodes of a network in order to reduce a diffusion process (DP) (e.g. an epidemic). In this paper we propose a multi-round dynamic control framework, which we realize through two derived models: the Restricted and the Sequential DRA (RDRA, SDRA), that allows for restricted information and access to the entire network, contrary to standard full-information and full-access DRA models. At each intervention round, the administrator has only access -- simultaneous for the former, sequential for the latter -- to a fraction of the network nodes. This sequential aspect in the decision process offers a completely new perspective to the dynamic DP control, making this work the first to cast the dynamic control problem as a series of sequential selection problems. Through in-depth SIS epidemic simulations we compare the performance of our multi-round approach with other resource allocation strategies and several sequential selection algorithms on both generated, and real-data networks. The results provide evidence about the efficiency and applicability of the proposed framework for real-life problems.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源