Spread of (mis)information in social networks

Games and Economic Behavior

Volumn 70, Issue 2, 2010, Pages 194-227

  Acemoglu, Daron ^a   Ozdaglar, Asuman ^b   ParandehGheibi, Ali ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b USA   (United States)

Author keywords

Information aggregation; Learning; Misinformation; Social networks

Indexed keywords

EID: 76149086844     PISSN: 08998256     EISSN: 10902473     Source Type: Journal    
DOI: 10.1016/j.geb.2010.01.005     Document Type: Article

References (41)

1. Acemoglu, D., Dahleh, Munther, Lobel, Ilan, Ozdaglar, A., 2008. Bayesian learning in social networks. Preprint.
2. Acemoglu, D., Ozdagar, A., ParandehGheibi, A., 2009. Spread of (mis)information in social networks, LIDS report 2812.
3. Aldous D., Fill J. Reversible Markov chains and random walks on graphs Monograph. http://www.stat.berkeley.edu/aldous/RWG/book.html.
4. Ambrus A., Takahashi S. Multi-sender cheap talk with restricted state spaces. Theoretical Econ. 2008, 3(1):1-27.
5. Bala V., Goyal S. Learning from neighbours. Rev. Econ. Stud. 1998, 65(3):595-621.
6. Bala V., Goyal S. Conformism and diversity under social learning. Econ. Theory 2001, 17:101-120.
7. Banerjee A. A simple model of herd behavior. Quart. J. Econ. 1992, 107:797-817.
8. Banerjee A., Fudenberg D. Word-of-mouth learning. Games Econ. Behav. 2004, 46:1-22.
9. Bikchandani S., Hirshleifer D., Welch I. A theory of fads, fashion, custom, and cultural change as information cascades. J. Polit. Economy 1992, 100:992-1026.
10. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D., 2005. Gossip algorithms: Design, analysis, and applications. In: Proceedings of IEEE INFOCOM.
11. Bremaud P. Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues 1999, Springer, New York.
12. Celen B., Kariv S. Distinguishing informational cascades from herd behavior in the laboratory. Amer. Econ. Rev. 2004, 94(3):484-498.
13. Celen B., Kariv S. Observational learning under imperfect information. Games Econ. Behav. 2004, 47(1):72-86.
14. Chung F.R.K. Spectral Graph Theory 1997, American Mathematical Society, Providence, RI.
15. Crawford V.P., Sobel J. Strategic information transmission. Econometrica 1982, 50(6):1431-1451.
16. DeGroot M.H. Reaching a consensus. J. Amer. Statistical Assoc. 1974, 69(345):118-121.
17. DeMarzo P.M., Vayanos D., Zwiebel J. Persuasion bias, social influence, and unidimensional opinions. Quart. J. Econ. 2003, 118(3):909-968.
18. Fagnani, F., Zampieri, S., forthcoming. Randomized consensus algorithms over large scale networks. IEEE J. Sel. Areas Commun.
19. Farrell J., Gibbons R. Cheap talk with two audiences. Amer. Econ. Rev. 1989, 79:1214-1223.
20. Gale D., Kariv S. Bayesian learning in social networks. Games Econ. Behav. 2003, 45(2):329-346.
21. Galeotti, A., Ghiglino, C., Squintani, F., 2009. Strategic information transmission in networks. Preprint.
22. Golub, B., Jackson, M.O., 2008. How homophily affects diffusion and learning in networks. Preprint.
23. Golub, B., Jackson, M.O., forthcoming. Naive learning in social networks: Convergence, influence, and the wisdom of crowds. Amer. Econ. J. Microecon.
24. Hagenbach, J., Koessler, F., 2009. Strategic communication networks. Preprint.
25. Haviv M., Van Der Heyden L. Perturbation bounds for the stationary probabilities of a finite Markov chain. Advanc. Appl. Prob. 1984, 16(4):804-818.
26. Jackson M.O. Social and Economic Networks 2008, Princeton University Press, Princeton, NJ.
27. Jadbabaie A., Lin J., Morse S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Automat. Control 2003, 48(6):988-1001.
28. Kemeny J.G., Snell J.L. Finite Markov Chains 1960, Van Nostrand, New York, NY.
29. Nedić, A., Ozdaglar, A., forthcoming. Distributed subgradient methods for multi-agent optimization. IEEE Trans. Automat. Control.
30. Olfati-Saber R., Murray R.M. Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Automat. Control 2004, 49(9):1520-1533.
31. Olshevsky, A., Tsitsiklis, J.N., forthcoming. Convergence speed in distributed consensus and averaging. SIAM J. Control Optim.
32. Rudin W. Real and Complex Analysis 1987, McGraw-Hill, New York, NY.
33. Schweitzer P.J. Perturbation theory and finite Markov chains. J. Appl. Prob. 1968, 5(2):401-413.
34. Seneta E. Nonnegative Matrices and Markov Chains 1985, Springer, Berlin, Translated from Russian by K.C. Kiwiel and A. Ruszczynski.
35. Shi J., Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Machine Intell. (PAMI) 2000, 22(8):888-905.
36. Smith, L., Sorensen, P., 1998. Rational social learning with random sampling. Unpublished manuscript.
37. Smith L., Sorensen P. Pathological outcomes of observational learning. Econometrica 2000, 68(2):371-398.
38. Sobel J. Signaling games. Encyclopedia of Complexity and System Science 2009, Springer.
39. Tsitsiklis, J.N., 1984. Problems in decentralized decision making and computation. PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology.
40. Tsitsiklis J.N., Bertsekas D.P., Athans M. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Automat. Control 1986, 31(9):803-812.
41. Watts D. Six Degrees: The Science of a Connected Age 2003, W.W. Norton and Company.