Complete game-theoretic characterization of SIS epidemics protection strategies

Abstract : Defining an optimal protection strategy against viruses, spam propagation or any other kind of contamination process is an important feature for designing new networks and architectures. In this work, we consider decentralized optimal protection strategies when a virus is propagating over a network through a Susceptible Infected Susceptible (SIS) epidemic process. We assume that each node in the network can fully protect itself from infection at a constant cost, or the node can use recovery software, once it is infected. We model our system using a game theoretic framework. Based on this model, we find pure and mixed equilibria, and evaluate the performance of the equilibria by finding the Price of Anarchy (PoA) in several network topologies. Finally, we give numerical illustrations of our results.
Document type :
Conference papers
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-01054710
Contributor : Eitan Altman <>
Submitted on : Friday, August 8, 2014 - 10:20:49 AM
Last modification on : Saturday, March 23, 2019 - 1:22:40 AM
Long-term archiving on : Wednesday, November 26, 2014 - 3:55:58 PM

File

stojan-cdc.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01054710, version 1

Collections

Citation

Yezekael Hayel, Stojan Trajanovski, Eitan Altman, Huijuan Wang, Piet van Mieghem. Complete game-theoretic characterization of SIS epidemics protection strategies. IEEE 53rd Annual Conference on Decision and Control (CDC 2014), Dec 2014, Los Angeles, United States. ⟨hal-01054710⟩

Share

Metrics

Record views

468

Files downloads

354