Dynamic Epidemic Control via Sequential Resource Allocation
@article{Fekom2020DynamicEC, title={Dynamic Epidemic Control via Sequential Resource Allocation}, author={Mathilde Fekom and Nicolas Vayatis and Argyris Kalogeratos}, journal={ArXiv}, year={2020}, volume={abs/2006.07199} }
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…
Figures and Tables from this paper
References
SHOWING 1-10 OF 25 REFERENCES
Sequential Dynamic Resource Allocation for Epidemic Control
- Computer Science, Mathematics2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019
The Sequential DRA (SDRA) model is proposed, inspired by sequential selection problems such as the well-known Secretary Problem, which introduces a sequential aspect in the decision process over the sample of each round, offering a completely new perspective to the dynamic DP control.
A Greedy Approach for Dynamic Control of Diffusion Processes in Networks
- Computer Science2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI)
- 2015
The Largest Reduction in Infectious Edges (LRIE) control strategy is proposed which is based on a greedy minimization of the cost associated to the undesired diffusion, and has the benefits of being efficient and easy to implement.
Suppressing Epidemics in Networks Using Priority Planning
- Computer ScienceIEEE Transactions on Network Science and Engineering
- 2016
This paper analyzes a large class of dynamic resource allocation strategies, named priority planning, that aim to suppress SIS epidemics taking place in a network and highlights that the cutwidth, which is the minimum maxcut of all possible linear arrangements for a network, is a fundamental network property that determines the resource budget required to suppress the epidemic.
Stochastic Optimal Control of Epidemic Processes in Networks
- MathematicsArXiv
- 2018
We approach the development of models and control strategies of susceptible-infected-susceptible (SIS) epidemic processes from the perspective of marked temporal point processes and stochastic…
Dynamic optimization model for allocating medical resources in epidemic controlling
- Business
- 2013
A three-level and dynamic linear programming model for allocating medical resources based on epidemic diffusion model is proposed and heuristic algorithm coupled with MTLAB mathematical programming solver is adopted to solve the model.
A dynamic vaccination strategy to suppress the recurrent epidemic outbreaks
- MedicineChaos, Solitons & Fractals
- 2018
The Warm-starting Sequential Selection Problem and its Multi-round Extension
- Computer Science
- 2018
A novel Warm-starting SSP (WSSP) setting which considers at hand a reference set, a set of previously selected items of a given quality, and tries to update optimally that set by (re-)assigning each job at most once, and a cutoff-based approach to optimize a rank-based objective function over the final assignment of the jobs.
An Introduction to Stochastic Epidemic Models
- Mathematics
- 2008
A brief introduction to the formulation of various types of stochastic epidemic models is presented based on the well-known deterministic SIS and SIR epidemic models. Three different types of…
Virus Spread in Networks
- Computer ScienceIEEE/ACM Transactions on Networking
- 2009
The influence of the network characteristics on the virus spread is analyzed in a new-the <i>N</i> -intertwined Markov chain-model, whose only approximation lies in the application of mean field…