Circles of Trust: Rival Information in Social Networks

Nikita Roketskiy (), Petra Persson and Samuel Lee

No 16597, CEPR Discussion Papers from C.E.P.R. Discussion Papers

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: Social Networks; Strategic information transmission; Rival information (search for similar items in EconPapers)
Date: 2021-10
References: Add references at CitEc
Citations:

Downloads: (external link)
https://cepr.org/publications/DP16597 (application/pdf)
CEPR Discussion Papers are free to download for our researchers, subscribers and members. If you fall into one of these categories but have trouble downloading our papers, please contact us at subscribers@cepr.org

Related works:
Working Paper: Circles of Trust: Rival Information in Social Networks (2021)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cpr:ceprdp:16597

Ordering information: This working paper can be ordered from
https://cepr.org/publications/DP16597

Access Statistics for this paper

More papers in CEPR Discussion Papers from C.E.P.R. Discussion Papers Centre for Economic Policy Research, 33 Great Sutton Street, London EC1V 0DX.
Bibliographic data for series maintained by ().