Cognitively-constrained learning from neighbors
type: Item
instance of: scholarly article
title: Cognitively-constrained learning from neighbors
zbMATH Open document ID: 1470.91206
author: Yanyan Li
published in: Games and Economic Behavior
publication date: 2021-08-25T00:00:00Z
Mathematics Subject Classification ID: 91D15
Mathematics Subject Classification ID: 91E40
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 7385243
zbMATH Keywords: depths of reasoning
zbMATH Keywords: (mis)learning in networks
zbMATH Keywords: heterogeneous cognitive ability
zbMATH Keywords: iterated learning procedure
MaRDI profile type: Publication
full work available at URL: j.geb.2021.05.004
OpenAlex ID: W3170091673
cites work: Bayesian learning in social networks
cites work: Agreeing to disagree
cites work: Learning from Neighbours
cites work: Estimating local interactions among many agents who observe their neighbors
cites work: Testing Models of Social Learning on Networks: Evidence From Two Experiments
cites work: Reaching a Consensus
cites work: Persuasion Bias, Social Influence, and Unidimensional Opinions
cites work: Word-of-Mouth Communication and Social Learning
cites work: Bayesian learning in social networks.
cites work: We can't disagree forever
cites work: Learning with Finite Memory
cites work: Non-Bayesian social learning
cites work: Identifying Higher-Order Rationality
cites work: Limited Depth of Reasoning and Failure of Cascade Formation in the Laboratory
cites work: Information diffusion in networks with the Bayesian peer influence heuristic
cites work: Locally Bayesian learning in networks
cites work: A Theory of Non-Bayesian Social Learning
cites work: Strategic Learning and the Topology of Social Networks
cites work: A general framework for rational learning in social networks
cites work: Does one Bayesian make a difference?
cites work: A general analysis of boundedly rational learning in social networks
cites work: Communication, consensus, and knowledge
cites work: On the interpretation of decision problems with imperfect recall
cites work: Estimating the Number of s-t Paths in a Graph
cites work: The Complexity of Enumeration and Reliability Problems
cites work: Bounded Memory and Biases in Information Processing
DOI: 10.1016/J.GEB.2021.05.004
description: scientific article; zbMATH DE number 7385243