Network Structure and Naive Sequential Learning
Krishna Dasaratha and
Papers from arXiv.org
We study a sequential learning model featuring a network of naive agents with Gaussian information structures. Agents wrongly believe their predecessors act solely on private information, so they neglect redundancies among observed actions. We provide a simple linear formula expressing agents' actions in terms of network paths and use this formula to characterize the set of networks where naive agents eventually learn correctly. This characterization shows that, on all networks where later agents observe more than one neighbor, there exist disproportionately influential early agents who can cause herding on incorrect actions. Going beyond existing social-learning results, we compute the probability of such mislearning exactly. This allows us to compare likelihoods of incorrect herding, and hence expected welfare losses, across network structures. The probability of mislearning increases when link densities are higher and when networks are more integrated. In partially segregated networks, divergent early signals can lead to persistent disagreement between groups.
New Economics Papers: this item is included in nep-gth, nep-mic, nep-net and nep-ure
Date: 2017-02, Revised 2019-07
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1) Track citations by RSS feed
Downloads: (external link)
http://arxiv.org/pdf/1703.02105 Latest version (application/pdf)
Journal Article: Network structure and naive sequential learning (Forthcoming)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:1703.02105
Access Statistics for this paper
More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().