Discussion paper

DP16597 Circles of Trust: Rival Information in Social Networks

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.


Persson, P, N Roketskiy and S Lee (eds) (2021), “DP16597 Circles of Trust: Rival Information in Social Networks”, CEPR Press Discussion Paper No. 16597. https://cepr.org/publications/dp16597