Game-Theoretic Protection Adoption Against Networked SIS Epidemics

In this paper, we investigate game-theoretic strategies for containing spreading processes on large-scale networks. Specifically, we consider the class of networked susceptible-infected-susceptible (SIS) epidemics where a large population of agents strategically choose whether to adopt partially effective protection. We define the utilities of the agents which depend on the degree of the agent, its individual infection status and action, as well as the the overall prevalence of the epidemic and strategy profile of the entire population. We further present the coupled dynamics of epidemic evolution as well as strategy update which is assumed to follow the replicator dynamics. By relying on timescale separation arguments, we first derive the game-theoretic protection adoption strategies of the agents for a given epidemic state, and then present the reduced epidemic dynamics. The existence and uniqueness of endemic equilibrium is rigorously characterized and forms the main result of this paper. We then present extensive numerical results to highlight the impacts of heterogeneous node degrees, infection rates, cost of protection adoption, and effectiveness of protection on the epidemic prevalence at the equilibrium. Finally, we illustrate the evolution of the networked SIR epidemic under game-theoretic protection adoption.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-03-27
DOI
https://doi.org/10.1109/tnse.2025.3554807
Citations
1
Primary Topic
COVID-19 epidemiological studies
Type
article
Field-Weighted Citation Impact
1.37
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Game-Theoretic Protection Adoption Against Networked SIS Epidemics

Abhisek Satapathi, Ashish R. Hota
1 citations
IEEE Transactions on Network Science and Engineering
COVID-19 epidemiological studies
1.37
article

Game-Theoretic Protection Adoption Against Networked SIS Epidemics

Abhisek Satapathi, Ashish R. Hota
article en
1 citations

Abstract

In this paper, we investigate game-theoretic strategies for containing spreading processes on large-scale networks. Specifically, we consider the class of networked susceptible-infected-susceptible (SIS) epidemics where a large population of agents strategically choose whether to adopt partially effective protection. We define the utilities of the agents which depend on the degree of the agent, its individual infection status and action, as well as the the overall prevalence of the epidemic and strategy profile of the entire population. We further present the coupled dynamics of epidemic evolution as well as strategy update which is assumed to follow the replicator dynamics. By relying on timescale separation arguments, we first derive the game-theoretic protection adoption strategies of the agents for a given epidemic state, and then present the reduced epidemic dynamics. The existence and uniqueness of endemic equilibrium is rigorously characterized and forms the main result of this paper. We then present extensive numerical results to highlight the impacts of heterogeneous node degrees, infection rates, cost of protection adoption, and effectiveness of protection on the epidemic prevalence at the equilibrium. Finally, we illustrate the evolution of the networked SIR epidemic under game-theoretic protection adoption.

IEEE Transactions on Network Science and EngineeringVol. 12(4)
Indian Institute of Technology Kharagpur (IN)
Good health and well-being
Openalex Percentile: Top 24%
COVID-19 epidemiological studies
1.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.