Optimal allocation of limited test resources for the quantification of COVID-19 infections
Ημερομηνία
2020Γλώσσα
en
Λέξη-κλειδί
Επιτομή
The systematic identification of infected individuals is critical for the containment of the COVID-19 pandemic. Currently, the spread of the disease is mostly quantified by the reported numbers of infections, hospitalisations, recoveries and deaths; these quantities inform epidemiology models that provide forecasts for the spread of the epidemic and guide policy making. The veracity of these forecasts depends on the discrepancy between the numbers of reported, and unreported yet infectious, individuals. We combine Bayesian experimental design with an epidemiology model and propose a methodology for the optimal allocation of limited testing resources in space and time, which maximises the information gain for such unreported infections. The proposed approach is applicable at the onset and spread of the epidemic and can forewarn of a possible recurrence of the disease after relaxation of interventions. We examine its application in Switzerland; the open source software is, however, readily adaptable to countries around the world. We find that following the proposed methodology can lead to vastly less uncertain predictions for the spread of the disease, thus improving estimates of the effective reproduction number and the future number of unreported infections. This information can provide timely and systematic guidance for the effective identification of infectious individuals and for decision-making regarding lockdown measures and the distribution of vaccines. © 2020 EMH Swiss Medical Publishers Ltd.. All rights reserved.
Collections
Related items
Showing items related by title, author, creator and subject.
-
Distributed resource allocation algorithms for peer-to-peer networks
Koutsopoulos, I.; Iosifidis, G. (2008)In peer-to-peer networks, each peer plays the role of client and server. As server, it receives content requests made by other peers and needs to decide on what basis and to what extent it will satisfy these requests by ... -
Continuous replica placement schemes in distributed systems
Loukopoulos, T.; Lampsas, P.; Ahmad, I. (2005)The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RPP formulations fall into two categories: ... -
Auction mechanisms for network resource allocation
Koutsopoulos, I.; Iosifidis, G. (2010)In the autonomic Internet of the future, auction mechanisms arise as key methods for realizing efficient resource allocation. The major asset of auctions is their obliviousness to node utilities, which renders them capable ...