Competition for Attention in Online Social Networks: Implications for Seeding Strategies
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Structural Holes and Good Ideas
Burt, R. S. (2004) · American Journal of Sociology · doi:10.1086/421787 · Cited by 5,642
What Makes Online Content Viral?
Berger, J., & Milkman, K. L. (2012) · Journal of Marketing Research · doi:10.1509/jmr.10.0353 · Cited by 3,178 · cited 3×
“Our approach controls for sample selection because someone may decide to share a message only if he or she believes that the information is useful for his or her friends (Berger and Milkman 2012) and, hence, obtains a higher reach.”
BackgroundThe spread of behavior in an online social network experiment
Centola, D. (2010) · Science · doi:10.1126/science.1185231 · Cited by 2,692
Causal diagrams for empirical research
PEARL, J. (1995) · Biometrika · doi:10.1093/biomet/82.4.669 · Cited by 2,355 · cited 2×
“The underlying mechanism contributes to the generalizability of our findings and reduces the concerns about selection bias (Pearl 1995).”
BackgroundExperimental Study of Inequality and Unpredictability in an Artificial Cultural Market
Salganik, M. J., Dodds, P. S., & Watts, D. J. (2006) · Science · doi:10.1126/science.1121066 · Cited by 2,231 · cited 1×
“Thus, although popularity remains hard to predict (Salganik et al. 2006), gaining consumer attention is crucial for the propagation of information.”
BackgroundEveryone's an influencer: quantifying influence on twitter
Bakshy, E., Hofman, J. M., Mason, W. A., & Watts, D. J. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935845 · Cited by 1,689
Lin, K.-Y., & Lu, H.-P. (2011) · Computers in Human Behavior · doi:10.1016/j.chb.2010.12.009 · Cited by 1,616 · cited 2×
“Such complementarity effects may occur when sharing messages is more enjoyable if someone’s friends or the people he or she follows also actively share messages (Lin and Lu 2011).”
BackgroundValente, T. W. (2012) · Science · doi:10.1126/science.1217330 · Cited by 1,271
Identifying influential and susceptible members of social networks
Aral, S., & Walker, D. (2012) · Science · doi:10.1126/science.1215842 · Cited by 1,047 · cited 2×
“Using randomized experiments on large social networks, Aral and Walker (2012) were able to measure susceptibility and in fl uence of network members and demonstrated their importance in propagation processes.”
BackgroundOpinion Leadership and Social Contagion in New Product Diffusion
Iyengar, R., Van den Bulte, C., & Valente, T. W. (2011) · Marketing Science · doi:10.1287/mksc.1100.0566 · Cited by 996
A multi-stage model of word-of-mouth influence through viral marketing
De Bruyn, A., & Lilien, G. L. (2008) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2008.03.004 · Cited by 906
Chains of affection: the structure of adolescent romantic and sexual networks
Bearman, P. S., Moody, J., & Stovel, K. (2004) · American Journal of Sociology · doi:10.1086/386272 · Cited by 817
The role of hubs in the adoption process
Goldenberg, J., Han, S., Lehmann, D. R., & Hong, J. W. (2009) · Journal of Marketing · doi:10.1509/jmkg.73.2.1 · Cited by 695
Bapna, R., & Umyarov, A. (2015) · Management Science · doi:10.1287/mnsc.2014.2081 · Cited by 350 · cited 1×
“Moreover, because highly connected individuals receive, on average, more information (Aral and Van Alstyne 2011, Bapna and Umyarov 2015), competition for attention and, thus susceptibility, depends on network position.”
Background“Gesundheit! Modeling Contagion through Facebook News Feed.”
Sun, E., Rosenn, I., Marlow, C., & Lento, T. (2009) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v3i1.13947 · Cited by 218
Competing for Attention in Social Media under Information Overload Conditions
Feng, L., Hu, Y., Li, B., Stanley, H. E., Havlin, S., & Braunstein, L. A. (2015) · PLOS ONE · doi:10.1371/journal.pone.0126090 · Cited by 133 · cited 2×
“However, in many situations, information does not spread easily on social networks (Sun et al. 2009, Bakshy et al. 2011, Feng et al. 2015), resulting in only a few campaigns that go truly viral (Watts and Peretti 2007, Goel et al. 2012).”
Background
Cited by
Finding goldilocks influencers: How follower count drives social media engagement
Wies, S., Bleier, A., & Edeling, A. (2023) · Journal of Marketing · doi:10.1177/00222429221125131 · Cited by 326
The impact of social nudges on user-generated content for social network platforms
Zeng, Z., Dai, H., Zhang, D. J., Zhang, H., Zhang, R., Xu, Z., & Shen, Z.-J. M. (2023) · Management Science · doi:10.1287/mnsc.2022.4622 · Cited by 76
Patel, K., Shah, M., Qureshi, K. M., & Qureshi, M. R. N. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11435-z · Cited by 42
Metadata
- Authors
- Gelper, S., van der Lans, R., & van Bruggen, G.
- Venue
- Management Science
- Published
- 2021-02
- Volume
- 67
- Issue
- 2
- Pages
- 1026-1047
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W3040523406
- Cited by
- 60
- References
- 16
- FWCI
- 2.59
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.