Better vaccination strategies for better people

In this paper, we study the vaccination of graphs against the outbreak of infectious diseases, in the following natural model generalizing a model by Aspnes et al.: An infectious disease breaks out at a random node of the graph and propagates along the edges of the graph. Vaccinated nodes cannot be infected, nor pass on the infection, whereas all other nodes do. The decisions on which nodes get vaccinated must be made before the random outbreak location is known. There is a cost associated with vaccination and a different cost with getting infected. In this model, we provide two results. First, we improve the approximation guarantee for finding the best vaccination strategy from O(log1.5 n) to O(log z) (where z is the support size of the outbreak distribution), by rounding a natural linear program with region-growing techniques. Second, we analyze the impact of autonomy on the part of the nodes: while a benevolent authority may suggest which nodes should be vaccinated, nodes may opt out after being chosen. We analyze the "Price of Opting Out" in this sense under partially altruistic behavior. Individuals base their decisions on their own cost and the societal cost, the latter scaled by some factor ß. If the altruism parameter is ß=0, it is known that the Price of Anarchy and Price of Stability can be Θ(n). We show that with positive altruism, Nash Equilibria may not exist, but the Price of Opting Out is at most 1/ß (whereas the Price of Anarchy can remain at Θ(n)).

[1]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[2]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[3]  Éva Tardos,et al.  Min-Max Multiway Cut , 2004, APPROX-RANDOM.

[4]  D. Levine Modeling Altruism and Spitefulness in Experiments , 1998 .

[5]  Joseph Naor,et al.  Fast approximate graph partitioning algorithms , 1997, SODA '97.

[6]  James Aspnes,et al.  Inoculation strategies for victims of viruses and the sum-of-squares partition problem , 2005, SODA '05.

[7]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[8]  J. Ledyard Public Goods: A Survey of Experimental Research , 1994 .

[9]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[10]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[11]  Chaitanya Swamy,et al.  Approximability of the Firefighter Problem , 2012, Algorithmica.

[12]  Vahab S. Mirrokni,et al.  Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[13]  David Kempe,et al.  Unbalanced Graph Cuts , 2005, ESA.

[14]  Mihalis Yannakakis,et al.  Multiway cuts in node weighted graphs , 2004, J. Algorithms.

[15]  Stefan Schmid,et al.  When selfish meets evil: byzantine players in a virus inoculation game , 2006, PODC '06.

[16]  Josep Díaz,et al.  On the Power of Mediators , 2009, WINE.

[17]  Stefan Schmid,et al.  On the windfall of friendship: inoculation strategies on social networks , 2008, EC '08.

[18]  Po-An Chen,et al.  Altruism, selfishness, and spite in traffic routing , 2008, EC '08.

[19]  A. Barabasi,et al.  Halting viruses in scale-free networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Chaitanya Swamy,et al.  Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity , 2009, ISAAC.

[21]  Eli Upfal,et al.  Stochastic models for the Web graph , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[22]  Tim Roughgarden,et al.  The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.