Competitive Influence Maximization in Social Networks

Social networks often serve as a medium for the diffusion of ideas or innovations. An individual's decision whether to adopt a product or innovation will be highly dependent on the choices made by the individual's peers or neighbors in the social network. In this work, we study the game of innovation diffusion with multiple competing innovations such as when multiple companies market competing products using viral marketing. Our first contribution is a natural and mathematically tractable model for the diffusion of multiple innovations in a network. We give a (1-1/e) approximation algorithm for computing the best response to an opponent's strategy, and prove that the "price of competition" of this game is at most 2. We also discuss "first mover" strategies which try to maximize the expected diffusion against perfect competition. Finally, we give an FPTAS for the problem of maximizing the influence of a single player when the underlying graph is a tree.

[1]  Adrian Vetta,et al.  Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[2]  Fan Chung Graham,et al.  Internet and Network Economics, Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings , 2007, WINE.

[3]  Boaz Patt-Shamir,et al.  Publish and perish: definition and analysis of an n-person publication impact game , 2006, SPAA '06.

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

[5]  Otfried Cheong,et al.  Competitive Facility Location along a Highway , 2001, COCOON.

[6]  Pradeep Dubey,et al.  Competing for Customers in a Social Network: The Quasi-linear Case , 2006, WINE.

[7]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

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

[9]  Elchanan Mossel,et al.  Submodularity of Influence in Social Networks: From Local to Global , 2010, SIAM J. Comput..

[10]  Jirí Matousek,et al.  The one-round Voronoi game , 2002, SCG '02.

[11]  H. Hotelling Stability in Competition , 1929 .

[12]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

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