Maximizing the Influence and Profit in Social Networks

Influence maximization problem is to find a set of seeds in social networks such that the cascade influence is maximized. Traditional models assume that all nodes are willing to spread the influence once they are influenced, and they ignore the disparity between influence and profit of a product. In this paper, by considering the role that price plays in viral marketing, we propose price related (PR) frame that contains PR-I and PR-L models for classic independent cascade and linear threshold models, respectively, which is a pioneer work. Two pricing strategies are designed, one is binary pricing (BYC), in which the seeds are offered free samples. The other is panoramic pricing (PAP), in which the seeds are offered different discounts. Furthermore, we find that influence and profit are like two sides of the coin, high price hinders the influence propagation and to enlarge the influence some sacrifice on profit is inevitable. Based on this observation under PR frame, by adopting a parameter to denote the decision maker’s preference toward influence and profit, we propose balanced influence and profit (BIP) maximization problem. We prove the NP-hardness of BIP maximization under PR-I and PR-L model. Unlike influence maximization, the BIP objective function is not monotone. Despite the nonmonotony, we show BIP objective function is submodular under certain conditions. Two unbudgeted greedy algorithms separately, named algorithm of BYC and algorithm of PAP are devised. We conduct extensive simulations on real world data sets, test the effectiveness of our proposed parameters, compare the algorithms’ performances, and evaluate the superiority of our algorithms over existing ones.

[1]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

[2]  Shaojie Tang,et al.  Adaptive Influence Maximization in Dynamic Social Networks , 2015, IEEE/ACM Transactions on Networking.

[3]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[4]  My T. Thai,et al.  A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing , 2017, IEEE/ACM Transactions on Networking.

[5]  Arijit Khan,et al.  Revenue maximization by viral marketing: A social network host's perspective , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[6]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[7]  Weili Wu,et al.  Effector Detection in Social Networks , 2016, IEEE Transactions on Computational Social Systems.

[8]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[9]  Frank Thomson Leighton,et al.  The value of knowing a demand curve: bounds on regret for online posted-price auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[10]  J. Kiefer,et al.  Sequential minimax search for a maximum , 1953 .

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

[12]  Laks V. S. Lakshmanan,et al.  Profit Maximization over Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

[13]  Vahab Mirrokni,et al.  Maximizing Non-Monotone Submodular Functions , 2007, FOCS 2007.

[14]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[15]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[16]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

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

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

[19]  Vahab S. Mirrokni,et al.  Optimal marketing strategies over social networks , 2008, WWW.

[20]  U. Feige,et al.  Maximizing Non-monotone Submodular Functions , 2011 .

[21]  Rajeev Motwani,et al.  Pricing Strategies for Viral Marketing on Social Networks , 2009, WINE.

[22]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.