A geometric analysis of the impact of large but finite switching rates on vaccination evolutionary games
In contemporary society, social networks accelerate decision dynamics causing a rapid switch of opinions in a number of fields, including the prevention of infectious diseases by means of vaccines. This means that opinion dynamics can nowadays be much faster than the spread of epidemics. Hence, we propose a Susceptible-Infectious-Removed epidemic model coupled with an evolutionary vaccination game embedding the public health system efforts to increase vaccine uptake. This results in a global system `epidemic model + evolutionary game''. The epidemiological novelty of this work is that we assume that the switching to the strategy `pro vaccine'' depends on the incidence of the disease. As a consequence of the above-mentioned accelerated decisions, the dynamics of the system acts on two different scales: a fast scale for the vaccine decisions and a slower scale for the spread of the disease. Another, and more methodological, element of novelty is that we apply Geometrical Singular Perturbation Theory (GSPT) to such a two-scale model and we then compare the geometric analysis with the Quasi-Steady-State Approximation (QSSA) approach, showing a criticality in the latter. Later, we apply the GSPT approach to the disease prevalence-based model already studied in (Della Marca and d'Onofrio, Comm Nonl Sci Num Sim, 2021) via the QSSA approach by considering medium-large values of the strategy switching parameter.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finite-Time Error Analysis of Soft Q-Learning: Switching System Approach
Soft Q-learning is a variation of Q-learning designed to solve entropy regularized Markov decision problems where an agent aims to maximize the entropy regularized value function. Despite its empirical success, there hav…
Q-LearningFinal Iteration Convergence Bound of Q-Learning: Switching System Approach
Q-learning is known as one of the fundamental reinforcement learning (RL) algorithms. Its convergence has been the focus of extensive research over the past several decades. Recently, a new finitetime error bound and ana…
Q-Learningreinforcement-learningReinforcement Learning (RL)Finite-Time Analysis of Minimax Q-Learning for Two-Player Zero-Sum Markov Games: Switching System Approach
The objective of this paper is to investigate the finite-time analysis of a Q-learning algorithm applied to two-player zero-sum Markov games. Specifically, we establish a finite-time analysis of both the minimax Q-learni…
Q-LearningFinite-sample analysis of identification of switched linear systems with arbitrary or restricted switching
For the identification of switched systems with a measured switching signal, this work aims to analyze the effect of switching strategies on the estimation error. The data for identification is assumed to be collected fr…
Cluster Consensus on Matrix-weighted Switching Networks
This paper examines the cluster consensus problem of multi-agent systems on matrix-weighted switching networks. Necessary and/or sufficient conditions under which cluster consensus can be achieved are obtained and quanti…