Abstract
In social networks, the problem of revenue maximization aims at maximizing the overall revenue from the purchasing behaviors of users under the influence propagations. Previous studies use a number of simulations on influence cascades to obtain the maximum revenue. However, these simulation-based methods are time-consuming and can’t be applied to large-scale networks. Instead, we propose calculation-based algorithms for revenue maximization, which gains the maximum revenue through fast approximate calculations within local acyclic graphs instead of the slow simulations across the global network. Furthermore, a max-Heap updating scheme is proposed to prune unnecessary calculations. These algorithms are designed for both the scenarios of unlimited and constrained commodity supply. Experiments on both the synthetic and real-world datasets demonstrate the efficiency and effectiveness of our proposals, that is, our algorithms run in orders of magnitude faster than the state-of-art baselines, and meanwhile, the maximum revenue achieved is nearly not affected.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Akhlaghpour, H., Ghodsi, M., Haghpanah, N., Mirrokni, V.S., Mahini, H., Nikzad, A.: Optimal iterative pricing over social networks (Extended abstract). In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 415–423. Springer, Heidelberg (2010). doi:10.1007/978-3-642-17572-5_34
Bensaid, B., Lesne, J.P.: Dynamic monopoly pricing with network externalities. Int. J. Ind. Organ. 14(6), 837–855 (1996)
Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1/2)-approximation for unconstrained submodular maximization. SIAM J. Comput. 44(5), 1384–1402 (2015)
Cabral, L.M.B., Salant, D.J., Woroch, G.A.: Monopoly pricing with network externalities. Int. J. Ind. Organ. 17(2), 199–214 (1999)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199–208 (2009)
Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM, pp. 88–97 (2010)
Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: Scaling up with guarantees. In: CIKM, pp. 629–638 (2014)
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57–66 (2001)
Feige, U., Mirrokni, V.S., Vondrak, J.: Maximizing non-monotone submodular functions. SIAM J. Comput. 40(4), 1133–1153 (2011)
Fotakis, D., Siminelakis, P.: On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities. Theor. Comput. Sci. 539, 68–86 (2014)
Freeman, L., Webster, C., Kirke, D.: Exploring social structure using dynamic three-dimensional color images. Soc. Netw. 20(2), 109–118 (1998)
Fromlet, H.: Predictability of financial crises: lessons from Sweden for other countries. Bus. Econ. 47(4), 262–272 (2012)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: ICDM, pp. 211–220 (2011)
Hartline, J., Mirrokni, V., Sundararajan, M.: Optimal marketing strategies over social networks. In: WWW, pp. 189–198 (2008)
Kahn, A.B.: Topological sorting of large networks. Commun. ACM 5(11), 558–562 (1962)
Kalish, S.: A new product adoption model with price, advertising, and uncertainty. Manag. Sci. 31(12), 1569–1585 (1985)
Katz, M., Shapiro, C.: Network externalities, competition, and compatibility. Am. Econ. Rev. 75(3), 424–440 (1985)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD, pp. 420–429 (2007)
Lu, W., Lakshmanan, L.V.S.: Profit maximization over social networks. In: ICDM, pp. 479–488 (2012)
Mason, R.: Network externalities and the coase conjecture. Eur. Econ. Rev. 44(10), 1981–1992 (2000)
McAuley, J., Leskovec, J.: Learning to discover social circles in ego networks. In: NIPS, pp. 539–547 (2012)
Mirrokni, V.S., Roch, S., Sundararajan, M.: On fixed-price marketing for goods with positive network externalities. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 532–538. Springer, Heidelberg (2012). doi:10.1007/978-3-642-35311-6_43
Sundararajan, A.: Local network effects and complex network structure. BE J. Theor. Econ. 7(1) (2007)
Teng, Y., Tai, C., Yu, P.S., Chen, M.: An effective marketing strategy for revenue maximization with a quantity constraint. In: KDD, pp. 1175–1184 (2015)
Acknowledgments
This work is supported in part by the State Key Development Program of Basic Research of China (No. 2013CB329605), the National Key Research and Development Program of China (No. 2016QY03D0605), the Natural Science Foundation of China (No. 61300014, 61372191, 61672313), NSF through grants IIS-1526499, and CNS-1626432.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Su, Y., Zhang, X., Xie, S., Yu, P.S., Fang, B. (2017). Efficient Revenue Maximization for Viral Marketing in Social Networks. In: Cong, G., Peng, WC., Zhang, W., Li, C., Sun, A. (eds) Advanced Data Mining and Applications. ADMA 2017. Lecture Notes in Computer Science(), vol 10604. Springer, Cham. https://doi.org/10.1007/978-3-319-69179-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-69179-4_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-69178-7
Online ISBN: 978-3-319-69179-4
eBook Packages: Computer ScienceComputer Science (R0)