skip to main content
10.1145/3018661.3018700acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Social Incentive Optimization in Online Social Networks

Published: 02 February 2017 Publication History

Abstract

Most online social networks provide a mechanism for users to broadcast messages to their personalized network through actions like shares, likes and tweets. Receiving positive feedback from the network such as likes, comments and retweets in response to such actions can provide a strong incentive for users to broadcast more often in the future. We call such feedback by the network, that influences a user to perform certain desirable future actions, social incentives. For example, after a user shares an article to her social network, receiving positive feedback such as a ''like'' from a friend can potentially encourage her to continue sharing more regularly. Typically, for every user's visit to an online social network site, good messages need to be ranked and selected by a recommender system from a large set of candidate messages (broadcasted by the user's network). In this paper, we propose a novel recommendation problem: How should we recommend messages to users to incentivize neighbors in their personal network to perform desirable actions in the future with high likelihood, without significantly hurting overall engagement for the entire system? For instance, messages could be content shared by neighbors. The goal in this case would be to encourage more content shares in the future. We call this problem social incentive optimization and study an instance of it for LinkedIn's news feed. We observe that a user who receives positive social feedback from neighbors has a higher likelihood of broadcasting more frequently. Using this observation, we develop a novel recommendation framework that incentivize users to broadcast more often, without significantly hurting overall feed engagement. We demonstrate the effectiveness of our approach through causal analysis on retrospective data and online A/B experiments.

References

[1]
D. Agarwal, B.-C. Chen, Q. He, Z. Hua, G. Lebanon, Y. Ma, P. Shivaswamy, H.-P. Tseng, J. Yang, and L. Zhang. Personalizing linkedin feed. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '15, pages 1651--1660, New York, NY, USA, 2015. ACM.
[2]
T. Althoff and J. Leskovec. Donor retention in online crowdfunding communities: A case study of donorschoose. org. In Proceedings of the 24th International Conference on World Wide Web, pages 34--44. ACM, 2015.
[3]
H. Bang and J. M. Robins. Doubly robust estimation in missing data and causal inference models. Biometrics, 61(4):962--973, 2005.
[4]
R. Bhattacharjee and A. Goel. Incentive based ranking mechanisms. In First Workshop on the Economics of Networked Systems (Netecon'06), pages 62--68, 2006.
[5]
M. Caliendo and S. Kopeinig. Some practical guidance for the implementation of propensity score matching. Journal of economic surveys, 22(1):31--72, 2008.
[6]
G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 2011.
[7]
J. Cheng, C. Danescu-Niculescu-Mizil, and J. Leskovec. How community feedback shapes user behavior. arXiv preprint arXiv:1405.1429, 2014.
[8]
T. J. DiCiccio and B. Efron. Bootstrap confidence intervals. Statistical science, pages 189--212, 1996.
[9]
R. Farzan, J. M. DiMicco, D. R. Millen, C. Dugan, W. Geyer, and E. A. Brownholtz. Results from deploying a participation incentive mechanism within the enterprise. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pages 563--572. ACM, 2008.
[10]
U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM (JACM), 45(4):634--652, 1998.
[11]
M. Feldman and J. Chuang. Overcoming free-riding behavior in peer-to-peer systems. ACM sigecom exchanges, 5(4):41--50, 2005.
[12]
M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions - ii. Polyhedral combinatorics, 1978.
[13]
A. Forte and A. Bruckman. Why do people write for wikipedia? incentives to contribute to open--content publishing. Proc. of GROUP, 5:6--9, 2005.
[14]
J. Freyne, M. Jacovi, I. Guy, and W. Geyer. Increasing engagement through early recommender intervention. In Proceedings of the third ACM conference on Recommender systems, pages 85--92. ACM, 2009.
[15]
J. Friedman, T. Hastie, and R. Tibshirani. Regularization paths for generalized linear models via coordinate descent. Journal of statistical software, 33(1):1, 2010.
[16]
F. M. Harper, D. Frankowski, S. Drenner, Y. Ren, S. Kiesler, L. Terveen, R. Kraut, and J. Riedl. Talk amongst yourselves: inviting users to participate in online conversations. In Proceedings of the 12th international conference on Intelligent user interfaces, pages 62--71. ACM, 2007.
[17]
F. M. Harper, X. Li, Y. Chen, and J. A. Konstan. An economic model of user rating in an online recommender system. In International Conference on User Modeling, pages 307--316. Springer, 2005.
[18]
D. G. Horvitz and D. J. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American statistical Association, 47(260):663--685, 1952.
[19]
K. Ling, G. Beenen, P. Ludford, X. Wang, K. Chang, X. Li, D. Cosley, D. Frankowski, L. Terveen, A. M. Rashid, et al. Using social psychology to motivate contributions to online communities. Journal of Computer-Mediated Communication, 10(4):00--00, 2005.
[20]
R. G. Newcombe. Two-sided confidence intervals for the single proportion: comparison of seven methods. Statistics in medicine, 17(8):857--872, 1998.
[21]
J. Park and M. van der Schaar. A game theoretic analysis of incentives in content production and sharing over peer-to-peer networks. IEEE Journal of Selected Topics in Signal Processing, 4(4):704--717, 2010.
[22]
J. J. Pfeiffer III and E. Zheleva. Incentivized sharing in social networks. In VLDB Workshop on Online Social Systems, 2012.
[23]
J. M. Robins, A. Rotnitzky, and L. P. Zhao. Estimation of regression coefficients when some regressors are not always observed. Journal of the American statistical Association, 89(427):846--866, 1994.
[24]
L. Sun and J. Vassileva. Social visualization encouraging participation in online communities. In International Conference on Collaboration and Technology, pages 349--363. Springer, 2006.
[25]
M. Tennenholtz, R. Varshavsky, R. Karidi, A. Zohar, E. Yuval, and K. Radinsky. Social incentives platform, June 21 2012. US Patent App. 12/970,968.
[26]
R. Wash and E. Rader. Public bookmarks and private benefits: An analysis of incentives in social computing. Proceedings of the American Society for Information Science and Technology, 44(1):1--13, 2007.
[27]
J. Xu, Y. Song, and M. Van Der Schaar. Incentivizing information sharing in networks. In 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 5467--5471. IEEE, 2014.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WSDM '17: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining
February 2017
868 pages
ISBN:9781450346757
DOI:10.1145/3018661
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 February 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. causal data analysis
  2. constrained optimization
  3. counterfactual models
  4. doubly robust estimation
  5. sharer retention
  6. social incentive optimization
  7. social networking

Qualifiers

  • Research-article

Conference

WSDM 2017

Acceptance Rates

WSDM '17 Paper Acceptance Rate 80 of 505 submissions, 16%;
Overall Acceptance Rate 498 of 2,863 submissions, 17%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)17
  • Downloads (Last 6 weeks)1
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Referral Strategy Based on Social Network IncentiveIEEE Transactions on Computational Social Systems10.1109/TCSS.2022.323087611:1(683-696)Online publication date: Feb-2024
  • (2024)A/B testingJournal of Systems and Software10.1016/j.jss.2024.112011211:COnline publication date: 2-Jul-2024
  • (2023)Social media feedback and extreme opinion expressionPLOS ONE10.1371/journal.pone.029380518:11(e0293805)Online publication date: 8-Nov-2023
  • (2023)Opinion Homogenization and PolarizationSampling in Judgment and Decision Making10.1017/9781009002042.024(436-464)Online publication date: 1-Jun-2023
  • (2023)Sampling as a Tool in Social EnvironmentsSampling in Judgment and Decision Making10.1017/9781009002042.020(357-464)Online publication date: 1-Jun-2023
  • (2021)Theoretical and computational characterizations of interaction mechanisms on Facebook dynamics using a common knowledge modelSocial Network Analysis and Mining10.1007/s13278-021-00791-711:1Online publication date: 5-Nov-2021

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media