Profit maximization for multiple products in online social networks

Information propagation in online social networks (OSNs), which helps shaping consumers' purchasing decisions, has received a lot of attention. The ultimate goal of marketing and advertising in OSNs is to massively influence audiences and enlarge the number of product adoptions. Most of existing works focus on maximizing the influence of a single product or promoting the adoption of one product in competing campaigns. However, in reality, the majority of companies produce various products for supplying customers with different needs. Therefore, it is truly significant and also challenging to wisely distribute limited budget across multiple products in viral marketing. In this paper, we investigate a Profit Maximization with Multiple Adoptions (PM2A) problem, which aims at maximizing the overall profit across all products. The natural greedy fails to provide a bounded result. In order to select high quality seeds for information propagation, we first proposed the PMCE algorithm, which has a ratio 1/2 (1 - 1/e2). Moreover, we further improve this ratio to (1-1/e) by proposing the PMIS algorithm. Comprehensive experiments on three real social networks are conducted. And results show that our algorithms outperform other heuristics, and better distribute the budget in terms of profit maximization.

[1]  Rong Zheng,et al.  On Budgeted Influence Maximization in Social Networks , 2012, IEEE Journal on Selected Areas in Communications.

[2]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[3]  My T. Thai,et al.  Maximizing the Spread of Positive Influence in Online Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

[4]  Huiyuan Zhang,et al.  Recent Advances in Information Diffusion and Influence Maximization of Complex Social Networks , 2014 .

[5]  Le Song,et al.  Budgeted Influence Maximization for Multiple Products , 2013, 1312.2164.

[6]  Divyakant Agrawal,et al.  Limiting the spread of misinformation in social networks , 2011, WWW.

[7]  Jaideep Srivastava,et al.  A Generalized Linear Threshold Model for Multiple Cascades , 2010, 2010 IEEE International Conference on Data Mining.

[8]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[9]  Laks V. S. Lakshmanan,et al.  Maximizing product adoption in social networks , 2012, WSDM '12.

[10]  Yifei Yuan,et al.  Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.

[11]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[12]  My T. Thai,et al.  Least Cost Influence in Multiplex Social Networks: Model Representation and Analysis , 2013, 2013 IEEE 13th International Conference on Data Mining.

[13]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[14]  My T. Thai,et al.  Cost-Effective Viral Marketing for Time-Critical Campaigns in Large-Scale Social Networks , 2014, IEEE/ACM Transactions on Networking.

[15]  Jure Leskovec,et al.  Patterns of Influence in a Recommendation Network , 2006, PAKDD.

[16]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.