{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:11:33Z","timestamp":1750824693258,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319635781"},{"type":"electronic","value":"9783319635798"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-63579-8_29","type":"book-chapter","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T05:02:42Z","timestamp":1501650162000},"page":"377-390","source":"Crossref","is-referenced-by-count":2,"title":["Viral Marketing for Digital Goods in Social Networks"],"prefix":"10.1007","author":[{"given":"Yu","family":"Qiao","sequence":"first","affiliation":[]},{"given":"Jun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Chongjun","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,3]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Hartline, J.D., Wright, A.: Competitive auctions and digital goods. In: Twelfth ACM-SIAM Symposium on Discrete Algorithms. pp. 735\u2013744 (2001)","DOI":"10.1007\/3-540-44676-1_35"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Chen, N., Gravin, N., Lu, P.: Optimal competitive auctions. In: ACM Symposium on Theory of Computing, pp. 253\u2013262 (2014)","DOI":"10.1145\/2591796.2591855"},{"key":"29_CR4","unstructured":"Lu, W.X., Zhang, P., Zhou, C., Liu, C., Gao, L.: Influence maximization in big networks: an incremental algorithm for streaming subgraph influence spread estimation. In: International Joint Conference on Artificial Intelligence, pp. 2076\u20132082 (2015)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Vanbriesen, J.M., Glance, N.: Cost-effective outbreak detection in networks. In: Knowledge Discovery and Data Mining, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Knowledge Discovery and Data Mining, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Alaei, S., Malekian, A., Srinivasan, A.: On random sampling auctions for digital goods. Electronic Commerce, pp. 187\u2013196 (2009)","DOI":"10.1145\/1566374.1566402"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Knowledge Discovery and Data Mining, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Hartline, J.D., Mirrokni, V., Sundararajan, M.: Optimal marketing strategies over social networks. In: International World Wide Web Conferences, pp. 189\u2013298 (2008)","DOI":"10.1145\/1367497.1367524"},{"key":"29_CR10","unstructured":"Lu, W., Lakshmanan, L.V.: Profit maximization over social networks. In: International Conference on Data Mining, pp. 189\u2013298 (2008)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Mirrokni, V., Vondrak, J.: Maximizing non-monotone submodular functions. In: Foundations of Computer Science, pp. 461\u2013471 (2007)","DOI":"10.1109\/FOCS.2007.29"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Naor, J., Schwartz, R.: A tight linear time (1\/2)-approximation for unconstrained submodular maximization. In: Foundations of Computer Science, pp. 649\u2013658 (2012)","DOI":"10.1109\/FOCS.2012.73"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-25255-1_12","volume-title":"Web Technologies and Applications","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Huang, H., Feng, C., Yang, X.: A co-ranking framework to select optimal seed set for influence maximization in heterogeneous network. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds.) APWeb 2015. LNCS, vol. 9313, pp. 141\u2013153. Springer, Cham (2015). doi: 10.1007\/978-3-319-25255-1_12"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Zhan, Q., Yang, H., Wang, C., Xie, J. A solution to influence maximization problem under cost control. In: International Conference on Tools with Artificial Intelligence, pp. 849\u2013856 (2013)","DOI":"10.1109\/ICTAI.2013.129"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Singer, Y.: How to win friends and influence people, truthfully: influence maximization mechanisms for social networks. In: Web Search and Data Mining, pp. 733\u2013742 (2012)","DOI":"10.1145\/2124295.2124381"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"2015","unstructured":"Granovetter, M.: Threshold models of collective behavior. Am. J. Sociol. 83, 1420\u20131443 (2015)","journal-title":"Am. J. Sociol."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, L., Chen, H., Wu, J., Wang, C., Xie, J.: False-name-proof mechanisms for path auctions in social networks. In: European Conference on Artificial Intelligence, pp. 323\u2013332 (2016)","DOI":"10.3233\/978-1-61499-672-9-1485"},{"key":"29_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions\u2014I. Math. Program. 14, 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"29_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis : Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis : Methods and Applications. Cambridge University Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63579-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:55:54Z","timestamp":1750794954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63579-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319635781","9783319635798"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63579-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}