.png){kind=icon}
.png){kind=icon}
Return
Bayesian Learning in Social Networks
.png){kind=icon}
OA
AI
DOI：10.1093/restud/rdr004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the (perfect Bayesian) equilibrium of a sequential learning model over a general social network. Each individual receives a signal about the underlying state of the world, observes the past actions of a stochastically generated neighbourhood of individuals, and chooses one of two possible actions. The stochastic process generating the neighbourhoods defines the network topology. We characterize pure strategy equilibria for arbitrary stochastic and deterministic social networks and characterize the conditions under which there will be asymptotic learning-convergence (in probability) to the right action as the social network becomes large. We show that when private beliefs are unbounded (meaning that the implied likelihood ratios are unbounded), there will be asymptotic learning as long as there is some minimal amount of expansion in observations. We also characterize conditions under which there will be asymptotic learning when private beliefs are bounded.
Keywords:
Information aggregation
Learning
Social networks
Herding
Information cascades