Multi-level Revenue Sharing for Viral Marketing

In this paper we present the design and analysis of revenue sharing schemes for viral marketing over social networks. The increasing need for monetizing social networks more effectively is causing social network platforms to look for alternatives to online behavioral targeting. Specifically, we turn to cooperative game theory and the Shapley value to design revenue sharing schemes to incentivize users to help the social network platform for more effective viral marketing. Our goal is to identify mechanisms that achieve desirable objectives in terms of computability, individual rationality, and potential reach. In particular, we propose multi-level revenue sharing for referral-based and viral marketing over online social networks. We show via simulations that users have more incentive to collaborate with the social network platform in implementing the campaign when the revenue or discount is shared across multiple levels rather than the commonly used single-level model. For this purpose, we design the graph-based model, for which we show that computing the Shapley value is #P-hard. However, we show that in a variation of that model, which we call the tree-based model, computing the Shapley value becomes polynomial time. We also show that the revenue function is supermodular only in the tree-based model. Supermodularity of the revenue function entails desirable corollaries.

[1]  L. Shapley Cores of convex games , 1971 .

[2]  Richard M. Karp,et al.  Monte-Carlo algorithms for the planar multiterminal network reliability problem , 1985, J. Complex..

[3]  Peter H. Reingen,et al.  Social Ties and Word-of-Mouth Referral Behavior , 1987 .

[4]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[5]  L. Shapley A Value for n-person Games , 1988 .

[6]  Jeroen Kuipers,et al.  On the computation of the nucleolus of a cooperative game , 2001, Int. J. Game Theory.

[7]  Vijay V. Vazirani,et al.  Applications of approximation algorithms to cooperative games , 2001, STOC '01.

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

[9]  Joan Feigenbaum,et al.  Hardness Results for Multicast Cost Sharing , 2002, FSTTCS.

[10]  Avanidhar Subrahmanyam,et al.  The Value of Private Information , 2005 .

[11]  Elena Yanovskaya,et al.  Serial cost sharing , 2006 .

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

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

[14]  Jianwei Huang,et al.  Can Bilateral ISP Peering Lead to Network-Wide Cooperative Settlement , 2008, 2008 Proceedings of 17th International Conference on Computer Communications and Networks.

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

[16]  Azadeh Iranmehr,et al.  Trust Management for Semantic Web , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

[17]  Vishal Misra,et al.  Internet Economics: The Use of Shapley Value for ISP Settlement , 2007, IEEE/ACM Transactions on Networking.

[18]  Edward Y. Chang,et al.  AdHeat: an influence-based diffusion model for propagating hints to match ads , 2010, WWW '10.

[19]  Stratis Ioannidis,et al.  Incentivizing peer-assisted services: a fluid shapley value approach , 2010, SIGMETRICS '10.

[20]  Vishal Misra,et al.  On Cooperative Settlement Between Content, Transit, and Eyeball Internet Service Providers , 2008, IEEE/ACM Transactions on Networking.

[21]  Duncan J. Watts,et al.  Everyone's an influencer: quantifying influence on twitter , 2011, WSDM '11.