Search arXivSearch

arXiv · 2303.09771

The spread of an epidemic: a game-theoretic approach

Abstract

We introduce and study a model stemming from game theory for the spread of an epidemic throughout a given population. Each agent is allowed to choose an action whose value dictates to what extent they limit their social interactions, if at all. Each of them is endowed with a certain amount of immunity such that if the viral risk/exposure is more than that they get infected. We consider a discrete-time stochastic process where, at the beginning of each epoch, a randomly chosen agent is allowed to update their action, which they do with the aim of maximizing a utility function that is a function of the state in which the process is currently in. The state itself is determined by the subset of infected agents at the beginning of that epoch, and the most recent action profile of all the agents. Our main results are concerned with the limiting distributions of both the cardinality of the subset of infected agents and the action profile as time approaches infinity, considered under various settings (such as the initial action profile we begin with, the value of each agent's immunity etc.). We also provide some simulations to show that the final asymptotic distributions for the cardinality of infected set are almost always achieved within the first few epochs.

Explore related subjects

Keep this discovery

BibTeXRIS

Sayar Karmakar, Moumanti Podder, Souvik Roy, Soumyarup Sadhukhan. 2023-03-17. The spread of an epidemic: a game-theoretic approach. https://arxiv.org/abs/2303.09771

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR