Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The spread of epidemics and malware is commonly modeled by diffusion processes on networks. Protective interventions such as vaccinations or installing anti-virus software are used to contain their spread. Typically, each node in the network has to decide its own strategy of securing itself, and its benefit depends on which other nodes are secure, making this a natural game-theoretic setting. There has been a lot of work on network security game models, but most of the focus has been either on simplified epidemic models or homogeneous network structure.#R##N##R##N# develop a new formulation for an epidemic containment game, which relies on the characterization of the SIS model in terms of the spectral radius of the network.  show in this model that pure Nash equilibria (NE) always exist, and can be found by a best response strategy.  analyze the complexity of finding NE, and derive rigorous bounds on their costs and the Price of Anarchy or PoA (the ratio of the cost of the worst NE to the optimum social cost) in general graphs as ll as in random graph models. In particular, for arbitrary por-law graphs with exponent β > 2,  show that the PoA is bounded by O(T2(β -1))), where T = γ/α is the ratio of the recovery rate to the transmission rate in the SIS model.  prove that this bound is tight up to a constant factor for the Chung-Lu random por-law graph model.  study the characteristics of Nash equilibria empirically in different real communication and infrastructure networks, and find that our analytical results can help explain some of the empirical observations.
['Sudip Saha', 'Abhijin Adiga', 'Anil Kumar S. Vullikanti']
I am writing a research paper on a idea Equilibria in epidemic containment games
[{"from": "human", "value": "I am writing a research paper on a idea Equilibria in epidemic containment games"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The spread of epidemics and malware is commonly modeled by diffusion processes on networks. Protective interventions such as vaccinations or installing anti-virus software are used to contain their spread. Typically, each node in the network has to decide its own strategy of securing itself, and its benefit depends on which other nodes are secure, making this a natural game-theoretic setting. There has been a lot of work on network security game models, but most of the focus has been either on simplified epidemic models or homogeneous network structure.#R##N##R##N# develop a new formulation for an epidemic containment game, which relies on the characterization of the SIS model in terms of the spectral radius of the network.  show in this model that pure Nash equilibria (NE) always exist, and can be found by a best response strategy.  analyze the complexity of finding NE, and derive rigorous bounds on their costs and the Price of Anarchy or PoA (the ratio of the cost of the worst NE to the optimum social cost) in general graphs as ll as in random graph models. In particular, for arbitrary por-law graphs with exponent \u03b2 > 2,  show that the PoA is bounded by O(T2(\u03b2 -1))), where T = \u03b3/\u03b1 is the ratio of the recovery rate to the transmission rate in the SIS model.  prove that this bound is tight up to a constant factor for the Chung-Lu random por-law graph model.  study the characteristics of Nash equilibria empirically in different real communication and infrastructure networks, and find that our analytical results can help explain some of the empirical observations."}]