Competition for Attention in Online Social Networks: Implications for Seeding Strategies release_fp3rfhajnrdl5ewl3x5kxtscja

by Sarah Gelper, Van der lans, Ralf J A, Gerrit van Bruggen

Published in Management science by Institute for Operations Research and the Management Sciences (INFORMS).

2020  

Abstract

Many firms try to leverage consumers' interactions on social platforms as part of their communication strategies. However, information on online social networks only propagates if it receives consumers' attention. This paper proposes a seeding strategy to maximize information propagation while accounting for competition for attention. The theory of exchange networks serves as the framework for identifying the optimal seeding strategy and recommends seeding people that have many friends, who, in turn, have only a few friends. There is little competition for the attention of those seeds' friends, and these friends are therefore responsive to the messages they receive. Using a game-theoretic model, we show that it is optimal to seed people with the highest Bonacich centrality. Importantly, in contrast to previous seeding literature that assumed a fixed and nonnegative connectivity parameter of the Bonacich measure, we demonstrate that this connectivity parameter is negative and needs to be estimated. Two independent empirical validations using a total of 34 social media campaigns on two different large online social networks show that the proposed seeding strategy can substantially increase a campaign's reach. The second study uses the activity network of messages exchanged to confirm that the effects are driven by competition for attention. This paper was accepted by Anandhi Bharadwaj, information systems.
In application/xml+jats format

Archived Files and Locations

application/pdf  1.3 MB
file_q57y3qnfx5gjdizb7ugflagxee
web.archive.org (webarchive)
repub.eur.nl (web)
Read Archived PDF
Archived
Type  article-journal
Stage   published
Date   2020-06-30
Language   en ?
Container Metadata
Not in DOAJ
In Keepers Registery
ISSN-L:  0025-1909
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e070e144-6c25-4c4b-a478-29aad9a839da
API URL: JSON