Working Paper: NBER ID: w29324
Authors: Petra Persson; Nikita Roketskiy; Samuel Lee
Abstract: We analyze the diffusion of rival information in a social network. In our model, rational agents can share information sequentially, unconstrained by an exogenous protocol or timing. We show how to compute the set of eventually informed agents for any network, and show that it is essentially unique under altruistic preferences. The relationship between network structure and information diffusion is complex because the former shapes both the charity and confidentiality of potential senders and receivers.
Keywords: No keywords provided
JEL Codes: D83; D85
Edges that are evidenced by causal inference methods are in orange, and the rest are in light blue.
| Cause | Effect |
|---|---|
| network structure (D85) | information diffusion (D85) |
| altruistic preferences (D64) | information diffusion (D85) |
| trust in N (Z13) | decision to share information with N (D70) |
| trust in other agents (M) (D82) | trust in N (Z13) |
| network structure (D85) | equilibrium constellation of trust (C62) |
| equilibrium constellation of trust (C62) | information diffusion (D85) |