Lorenzo Zino ; Alessandro Rizzo ; Maurizio Porfiri

IEEE Control Systems Letters 4(4)

In this letter, we propose an epidemic model over temporal networks that explicitly encapsulates two different control actions. We develop our model within the theoretical framework of activity driven networks (ADNs), which have emerged as a valuable tool to capture the complexity of dynamical processes on networks, coevolving at a comparable time scale to the temporal network formation. Specifically, we complement a susceptible–infected–susceptible epidemic model with features that are typical of nonpharmaceutical interventions in public health policies: i) actions to promote awareness, which induce people to adopt self-protective behaviors, and ii) confinement policies to reduce the social activity of infected individuals. In the thermodynamic limit of large-scale populations, we use a mean-field approach to analytically derive the epidemic threshold, which offers viable insight to devise containment actions at the early stages of the outbreak. Through the proposed model, it is possible to devise an optimal epidemic control policy as the combination of the two strategies, arising from the solution of an optimization problem. Finally, the analytical computation of the epidemic prevalence in endemic diseases on homogeneous ADNs is used to optimally calibrate control actions toward mitigating an endemic disease. Simulations are provided to support our theoretical results.

Source: ieeexplore.ieee.org

Shayegan Omidshafiei, Karl Tuyls, Wojciech M. Czarnecki, Francisco C. Santos, Mark Rowland, Jerome Connor, Daniel Hennes, Paul Muller, Julien Perolat, Bart De Vylder, Audrunas Gruslys, Remi Munos

Games are traditionally recognized as one of the key testbeds underlying progress in artificial intelligence (AI), aptly referred to as the "Drosophila of AI". Traditionally, researchers have focused on using games to build strong AI agents that, e.g., achieve human-level performance. This progress, however, also requires a classification of how ‘interesting’ a game is for an artificial agent. Tackling this latter question not only facilitates an understanding of the characteristics of learnt AI agents in games, but also helps to determine what game an AI should address next as part of its training. Here, we show how network measures applied to so-called response graphs of large-scale games enable the creation of a useful landscape of games, quantifying the relationships between games of widely varying sizes, characteristics, and complexities. We illustrate our findings in various domains, ranging from well-studied canonical games to significantly more complex empirical games capturing the performance of trained AI agents pitted against one another. Our results culminate in a demonstration of how one can leverage this information to automatically generate new and interesting games, including mixtures of empirical games synthesized from real world games.

Source: arxiv.org