Influence maximization in noncooperative social networks

In this paper, we consider the problem of maximizing information propagation with noncooperative nodes in social networks. We generalize the linear threshold model to take node noncooperation into consideration and provide a provable approximation guarantees for the noncooperative influence maximization problem. We propose an analytical model based on the generalized maximum flow problem to characterize the noncooperative behavior of an individual node in maximizing influence. Based on this, we develop a new seed node selection strategy, under the linear threshold model, to account for user noncooperativeness. Extensive simulations on large collaboration networks show that our proposed flow-based strategy outperforms the weighted degree scheme under various noncooperative scenarios. The evaluation also validates the importance of cooperation and incentives in maximizing influence.

[1]  Eitan Altman,et al.  Inefficient Noncooperation in Networking Games of Common-Pool Resources , 2008, IEEE Journal on Selected Areas in Communications.

[2]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[3]  David K. Perry,et al.  Viral Marketing or Electronic Word-of-Mouth Advertising: Examining Consumer Responses and Motivations to Pass Along Email , 2004, Journal of Advertising Research.

[4]  Hisao Kameda,et al.  Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers , 2002, JACM.

[5]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[6]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[7]  L. Freeman,et al.  Centrality in valued graphs: A measure of betweenness based on network flow , 1991 .

[8]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[9]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[10]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[11]  Alan Mislove,et al.  Bazaar: Strengthening User Reputations in Online Marketplaces , 2011, NSDI.

[12]  Victor O. K. Li,et al.  The Probabilistic Maximum Coverage Problem in Social Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[13]  Ravi Kumar,et al.  Influence and correlation in social networks , 2008, KDD.

[14]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[15]  Krishna P. Gummadi,et al.  Measuring User Influence in Twitter: The Million Follower Fallacy , 2010, ICWSM.

[16]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

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

[18]  Masahiro Kimura,et al.  Selecting Information Diffusion Models over Social Networks for Behavioral Analysis , 2010, ECML/PKDD.

[19]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

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

[21]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[22]  Keith W. Ross,et al.  P2P Trading in Social Networks: The Value of Staying Connected , 2010, 2010 Proceedings IEEE INFOCOM.

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

[24]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[25]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[26]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[27]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.