Abstract
Continually arriving information is communicated through a network of n agents, with the value of information to the j’th recipient being a decreasing function of j ∕ n, and communication costs paid by recipient. Regardless of details of network and communication costs, the social optimum policy is to communicate arbitrarily slowly. But selfish agent behavior leads to Nash equilibria which (in the n → ∞ limit) may be efficient (Nash payoff = social optimum payoff) or wasteful (0 < Nash payoff < social optimum payoff) or totally wasteful (Nash payoff = 0). We study the cases of the complete network (constant communication costs between all agents), the grid with only nearest-neighbor communication, and the grid with communication cost a function of distance. The main technical tool is analysis of the associated first passage percolation process or SI epidemic (representing spread of one item of information) and in particular its “window width”, the time interval during which most agents learn the item. In this version (written in July 2007) many arguments are just outlined, not intended as complete rigorous proofs. One of the topics herein (first passage percolation on the N ×N torus with short and long range interactions; Sect. 6.2) has now been studied rigorously by Chatterjee and Durrett[4].
Mathematics Subject Classification (2010): 60K35, 91A28
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aldous, D.J., Bhamidi, S.: Edge flows in the compete random-lengths network. Random Structures Alg. 37, 271–311 (2010)
Andersson, H., Britton, T.: Stochastic epidemic models and their statistical analysis. Volume 151 of Lecture Notes in Statistics. Springer, New York (2000)
Biggs, N.L.: Algebraic Graph Theory. Cambridge University Press, London/New York (1974)
Chatterjee, S., Durrett, R.: Asymptotic Behavior of Aldous’ Gossip Process. Ann. Appl. Probab. 21, 2447–2482 (2011)
Daley, D.J., Kendall, D.G.: Stochastic rumours. IMA J. Appl. Math. 1, 42–55 (1965)
Hauert, C., Szabo, G.: Game theory and physics. Am. J. Phys. 73(5), 405–414 (2005)
Jackson, M.O.: A survey of models of network formation: stability and efficiency. In: Demange, G., Wooders, M.H. (eds.) Group Formation in Economics: Networks, Clubs, and Coalitions. Cambridge University Press, Cambridge/New York (2005)
Kempe, D., Kleinberg, J., Demers, A.: Spatial gossip and resource location protocols. J. ACM 51(6), 943–967 (2004)
Kendall, D.G.: La propagation d’une épidémie ou d’un bruit dans une population limitée. Publ. Inst. Stat. Univ. Paris 6, 307–311 (1957)
Kephart, J.O., White, S.R.: Directed-graph epidemiological models of computer viruses. In: Proceedings 1991 IEEE Computer Society Symposium on Research in Security and Privacy, pp 343–359. Los Alamitos, CA (1991)
Kesten, H.: First-passage percolation. In: From Classical to Modern Probability. Volume 54 of Progress in Probability, pp. 93–143. Birkhäuser, Basel (2003)
Rogers, E.M.: Diffusion of Innovations, 5th edn. Free Press, New York (2003)
van der Hofstad, R., Hooghiemstra, G., Van Mieghem, P.: The flooding time in random graphs. Extremes 5(2), 111–129 (2003), 2002
Acknowledgements
I thank an anonymous referee for careful reading and helpful suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aldous, D.J. (2013). When Knowing Early Matters: Gossip, Percolation and Nash Equilibria. In: Shiryaev, A., Varadhan, S., Presman, E. (eds) Prokhorov and Contemporary Probability Theory. Springer Proceedings in Mathematics & Statistics, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33549-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-33549-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33548-8
Online ISBN: 978-3-642-33549-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)