{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T14:09:30Z","timestamp":1778681370851,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005950","name":"The Hong Kong University of Science and Technology","doi-asserted-by":"crossref","award":["Startup Grant"],"award-info":[{"award-number":["Startup Grant"]}],"id":[{"id":"10.13039\/501100005950","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["2018-T1-002-063"],"award-info":[{"award-number":["2018-T1-002-063"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["2019-T1-002-042"],"award-info":[{"award-number":["2019-T1-002-042"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00778-021-00727-9","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T09:04:06Z","timestamp":1642755846000},"page":"779-795","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal price profile for influential nodes in online social networks"],"prefix":"10.1007","volume":"31","author":[{"given":"Yuqing","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0785-707X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"issue":"7","key":"727_CR1","doi-asserted-by":"publisher","first-page":"814","DOI":"10.14778\/2752939.2752950","volume":"8","author":"C Aslay","year":"2015","unstructured":"Aslay, C., Lu, W., Bonchi, F., Goyal, A., Lakshmanan, L.V.: Viral marketing meets social advertising: ad allocation with minimum regret. Proc. VLDB Endow. 8(7), 814\u2013825 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"11","key":"727_CR2","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.14778\/3137628.3137635","volume":"10","author":"C Aslay","year":"2017","unstructured":"Aslay, C., Bonchi, F., Lakshmanan, L.V., Lu, W.: Revenue maximization in incentivized social advertising. Proc. VLDB Endow. 10(11), 1238\u20131249 (2017)","journal-title":"Proc. VLDB Endow."},{"key":"727_CR3","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proc. SODA, pp. 946\u2013957 (2014)","DOI":"10.1137\/1.9781611973402.70"},{"issue":"1","key":"727_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/2796314.2745853","volume":"43","author":"P Chalermsook","year":"2015","unstructured":"Chalermsook, P., Das Sarma, A., Lall, A., Nanongkai, D.: Social network monetization via sponsored viral marketing. ACM SIGMETRICS Perform. Eval. Rev. 43(1), 259\u2013270 (2015)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"727_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proc. ACM KDD, pp. 199\u2013208 (2009)","DOI":"10.1145\/1557019.1557047"},{"key":"727_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proc. ACM KDD, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"727_CR7","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proc. IEEE ICDM, pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"727_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, S., Shen, H., Huang, J., Chen, W., Cheng, X.: Imrank: influence maximization via finding self-consistent ranking. In: Proc. ACM SIGIR, pp. 475\u2013484 (2014)","DOI":"10.1145\/2600428.2609592"},{"issue":"1","key":"727_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"F Chung","year":"2006","unstructured":"Chung, F., Lu, L.: Concentration inequalities and martingale inequalities: a survey. Internet Math. 3(1), 79\u2013127 (2006)","journal-title":"Internet Math."},{"key":"727_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, E., Delling, D., Pajor, T., Werneck, R.F.: Sketch-based influence maximization and computation: scaling up with guarantees. In: Proc. ACM CIKM, pp. 629\u2013638 (2014)","DOI":"10.1145\/2661829.2662077"},{"issue":"5","key":"727_CR11","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for Monte Carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"key":"727_CR12","doi-asserted-by":"crossref","unstructured":"Domingos, P., Richardson, M.: Mining the network value of customers. In: Proc. ACM KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"727_CR13","unstructured":"eMarketer: Social network ad spending worldwide, by region, 2013\u20132017. https:\/\/www.emarketer.com\/Chart\/Social-Network-Ad-Spending-Worldwide-by-Region-2013-2017\/168356 (2015)"},{"key":"727_CR14","unstructured":"eMarketer: Influencer marketing is about data, not celebrity deals. https:\/\/www.emarketer.com\/Article\/Influencer-Marketing-About-Data-Not-Celebrity-Deals\/1016683 (2017)"},{"key":"727_CR15","unstructured":"eMarketer: How much are brands paying influencers?. https:\/\/www.emarketer.com\/content\/how-much-are-brands-paying-influencers (2019)"},{"key":"727_CR16","unstructured":"eMarketer: Is everyone on instagram an influencer?. https:\/\/www.emarketer.com\/content\/is-everyone-on-instagram-an-influencer (2019)"},{"issue":"9","key":"727_CR17","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.14778\/3213880.3213883","volume":"11","author":"K Han","year":"2018","unstructured":"Han, K., Huang, K., Xiao, X., Tang, J., Sun, A., Tang, X.: Efficient algorithms for adaptive influence maximization. Proc. VLDB Endow. 11(9), 1029\u20131040 (2018)","journal-title":"Proc. VLDB Endow."},{"issue":"6","key":"727_CR18","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s00778-020-00615-8","volume":"29","author":"K Huang","year":"2020","unstructured":"Huang, K., Tang, J., Han, K., Xiao, X., Chen, W., Sun, A., Tang, X., Lim, A.: Efficient approximation algorithms for adaptive influence maximization. VLDB J. 29(6), 1385\u20131406 (2020)","journal-title":"VLDB J."},{"key":"727_CR19","doi-asserted-by":"crossref","unstructured":"Huang, K., Tang, J., Xiao, X., Sun, A., Lim, A.: Efficient approximation algorithms for adaptive target profit maximization. In: Proc. IEEE ICDE, pp. 649\u2013660 (2020)","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"727_CR20","unstructured":"Hub, I.M.: The remarkable rise of influencer marketing. https:\/\/influencermarketinghub.com\/the-rise-of-influencer-marketing\/ (2020)"},{"key":"727_CR21","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proc. ACM KDD, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"key":"727_CR22","doi-asserted-by":"crossref","unstructured":"Khan, A., Zehnder, B., Kossmann, D.: Revenue maximization by viral marketing: a social network host\u2019s perspective. In: Proc. IEEE ICDE, pp. 37\u201348 (2016)","DOI":"10.1109\/ICDE.2016.7498227"},{"key":"727_CR23","doi-asserted-by":"crossref","unstructured":"Kwak, H., Lee, C., Park, H., Moon, S.: What is Twitter, a social network or a news media? In: Proc. WWW, pp. 591\u2013600 (2010)","DOI":"10.1145\/1772690.1772751"},{"key":"727_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proc. ACM KDD, pp. 420\u2013429 (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"727_CR25","doi-asserted-by":"crossref","unstructured":"Lu, W., Lakshmanan, L.V.: Profit maximization over social networks. In: Proc. IEEE ICDM, pp. 479\u2013488 (2012)","DOI":"10.1109\/ICDM.2012.145"},{"key":"727_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proc. ACM SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"727_CR27","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Nguyen, T.P., Vu, T.N., Dinh, T.N.: Outward influence and cascade size estimation in billion-scale networks. In: Proc. ACM SIGMETRICS, p. 63 (2017)","DOI":"10.1145\/3078505.3078526"},{"key":"727_CR28","unstructured":"Reuters: Social media ad spending is expected to pass newspapers by 2020. http:\/\/fortune.com\/2016\/12\/05\/social-media-ad-spending-newspapers-zenith-2020\/ (2016)"},{"key":"727_CR29","doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proc. ACM KDD, pp. 61\u201370 (2002)","DOI":"10.1145\/775047.775057"},{"key":"727_CR30","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks. In: Proc. IEEE ICNP, pp. 1\u201310 (2016)","DOI":"10.1109\/ICNP.2016.7784445"},{"key":"727_CR31","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Influence maximization meets efficiency and effectiveness: a hop-based approach. In: Proc. IEEE\/ACM ASONAM, pp. 64\u201371 (2017)","DOI":"10.1145\/3110025.3110041"},{"key":"727_CR32","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Xiao, X., Yuan, J.: Online processing algorithms for influence maximization. In: Proc. ACM SIGMOD, pp. 991\u20131005 (2018)","DOI":"10.1145\/3183713.3183749"},{"issue":"1","key":"727_CR33","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: An efficient and effective hop-based approach for influence maximization in social networks. Soc. Netw. Anal. Min. 8(1), 10 (2018)","journal-title":"Soc. Netw. Anal. Min."},{"issue":"6","key":"727_CR34","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2018","unstructured":"Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans. Knowl. Data Eng. 30(6), 1095\u20131108 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"727_CR35","doi-asserted-by":"crossref","unstructured":"Tang, J., Tang, X., Yuan, J.: Towards profit maximization for online social network providers. In: Proc. IEEE INFOCOM, pp. 1178\u20131186 (2018)","DOI":"10.1109\/INFOCOM.2018.8485975"},{"key":"727_CR36","doi-asserted-by":"crossref","unstructured":"Tang, J., Huang, K., Xiao, X., Lakshmanan, L.V., Tang, X., Sun, A., Lim, A.: Efficient approximation algorithms for adaptive seed minimization. In: Proc. ACM SIGMOD, pp. 1096\u20131113 (2019)","DOI":"10.1145\/3299869.3319881"},{"key":"727_CR37","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proc. ACM SIGMOD, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"727_CR38","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proc. ACM SIGMOD, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"issue":"10","key":"727_CR39","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.14778\/3401960.3401961","volume":"13","author":"Y Zhu","year":"2020","unstructured":"Zhu, Y., Tang, J., Tang, X.: Pricing influential nodes in online social networks. Proc. VLDB Endow. 13(10), 1614\u20131627 (2020)","journal-title":"Proc. VLDB Endow."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00727-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00727-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00727-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T04:06:31Z","timestamp":1656129991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00727-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["727"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00727-9","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"28 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}