A Theory of Non‐Bayesian Social Learning

This paper studies the behavioral foundations of non†Bayesian models of learning over social networks and develops a taxonomy of conditions for information aggregation in a general framework. As our main behavioral assumption, we postulate that agents follow social learning rules that satisfy “imperfect recall,†according to which they treat the current beliefs of their neighbors as sufficient statistics for the entire history of their observations. We augment this assumption with various restrictions on how agents process the information provided by their neighbors and obtain representation theorems for the corresponding learning rules (including the canonical model of DeGroot). We then obtain general long†run learning results that are not tied to the learning rules' specific functional forms, thus identifying the fundamental forces that lead to learning, non†learning, and mislearning in social networks. Our results illustrate that, in the presence of imperfect recall, long†run aggregation of information is closely linked to (i) the rate at which agents discount their neighbors' information over time, (ii) the curvature of agents' social learning rules, and (iii) whether their initial tendencies are amplified or moderated as a result of social interactions.

[1]  William McCuaig,et al.  A simple proof of Menger's theorem , 1984, J. Graph Theory.

[2]  S. Bikhchandani,et al.  You have printed the following article : A Theory of Fads , Fashion , Custom , and Cultural Change as Informational Cascades , 2007 .

[3]  A. Mucci,et al.  Another martingale convergence theorem , 1976 .

[4]  Elchanan Mossel,et al.  Bayesian Group Decisions: Algorithms and Complexity , 2017, ArXiv.

[5]  A. Kolmogoroff Zur Theorie der Markoffschen Ketten , 1936 .

[6]  Gilat Levy,et al.  Information diffusion in networks with the Bayesian Peer Influence heuristic , 2018, Games Econ. Behav..

[7]  A. Banerjee,et al.  A Simple Model of Herd Behavior , 1992 .

[8]  E. Seneta Non-negative Matrices and Markov Chains , 2008 .

[9]  M. Rabin,et al.  Extensive Imitation is Irrational and Harmful , 2014 .

[10]  Ilan Lobel,et al.  BAYESIAN LEARNING IN SOCIAL NETWORKS , 2008 .

[11]  E. Seneta,et al.  Towards consensus: some convergence theorems on repeated averaging , 1977, Journal of Applied Probability.

[12]  Elchanan Mossel,et al.  On the Speed of Social Learning , 2014, SSRN Electronic Journal.

[13]  G. Rota On the foundations of combinatorial theory I. Theory of Möbius Functions , 1964 .

[14]  Lin Wang,et al.  Social learning with time-varying weights , 2014, Journal of Systems Science and Complexity.

[15]  J. Steele Le Cam's inequality and poisson approximations , 1994 .

[16]  Ali Jadbabaie,et al.  Non-Bayesian Social Learning , 2011, Games Econ. Behav..

[17]  P. DeMarzo,et al.  Persuasion Bias, Social Influence, and Uni-Dimensional Opinions , 2001 .

[18]  H. K. Kim Rational Consensus in Science and Society: A Philosophical and Mathematical Study: Keith Lehrer and Carl Wagner London: Reidel, 1981, 165 pages, $26 , 1985 .

[19]  Alvaro Sandroni,et al.  Non-Bayesian Learning , 2010 .

[20]  R. Nussbaum Hilbert's Projective Metric and Iterated Nonlinear Maps , 1988 .

[21]  M. Degroot Reaching a Consensus , 1974 .

[22]  B. Golub,et al.  How Homophily Affects the Speed of Learning and Best Response Dynamics , 2012 .

[23]  Matthew O. Jackson,et al.  Naïve Learning in Social Networks and the Wisdom of Crowds , 2010 .

[24]  Arun G. Chandrasekhar,et al.  Testing Models of Social Learning on Networks: Evidence from a Lab Experiment in the Field , 2015 .

[25]  M. Rabin,et al.  Naïve Herding in Rich-Information Settings , 2010 .

[26]  Evan Sadler,et al.  Learning in Social Networks , 2016 .