{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:09:31Z","timestamp":1753438171415,"version":"3.40.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T00:00:00Z","timestamp":1671580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12071459","11991022"],"award-info":[{"award-number":["12071459","11991022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["E1E40107X2"],"award-info":[{"award-number":["E1E40107X2"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10878-022-00967-7","type":"journal-article","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T16:03:30Z","timestamp":1671638610000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Diversified-profit maximization in competitive social advertising"],"prefix":"10.1007","volume":"45","author":[{"given":"Liman","family":"Du","sequence":"first","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Ali K, Wang CY, Chen YS (2018) Boosting reinforcement learning in competitive influence maximization with transfer learning. In: 2018 IEEE\/WIC\/ACM international conference on web intelligence (WI), pp 395\u2013400. https:\/\/doi.org\/10.1109\/WI.2018.00-62","key":"967_CR1","DOI":"10.1109\/WI.2018.00-62"},{"unstructured":"Ansari A, Dadgar M, Hamzeh A, Schl\u00f6tterer J, Granitzer M (2019) Competitive influence maximization: integrating budget allocation and seed selection. arXiv:1912.12283","key":"967_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bharathi S, Kempe D, Salek H (2007) Competitive influence maximization in social networks. pp 306\u2013311. https:\/\/doi.org\/10.1007\/978-3-540-77105-0_31","key":"967_CR3","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"967_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi A, Samet S, Kwisthout J, Wareham T (2017) Community-based influence maximization in social networks under a competitive linear threshold model. Knowl Based Syst 134:149\u2013158. https:\/\/doi.org\/10.1016\/j.knosys.2017.07.029","journal-title":"Knowl Based Syst"},{"doi-asserted-by":"publisher","unstructured":"Carnes T, Nagarajan C, Wild SM, van Zuylen A (2007) Maximizing influence in a competitive social network: a follower\u2019s perspective. In: Proceedings of the ninth international conference on electronic commerce, ICEC\u201907. Association for Computing Machinery, New York, pp 351\u2013360. https:\/\/doi.org\/10.1145\/1282100.1282167","key":"967_CR5","DOI":"10.1145\/1282100.1282167"},{"doi-asserted-by":"publisher","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201909. Association for Computing Machinery, New York, pp 199\u2013208. https:\/\/doi.org\/10.1145\/1557019.1557047","key":"967_CR6","DOI":"10.1145\/1557019.1557047"},{"doi-asserted-by":"publisher","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. pp 1029\u20131038. https:\/\/doi.org\/10.1145\/1835804.1835934","key":"967_CR7","DOI":"10.1145\/1835804.1835934"},{"doi-asserted-by":"publisher","unstructured":"Chen W, Lin T, Tan Z, Zhao M, Zhou X (2016) Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, San Francisco California USA, pp 795\u2013804. https:\/\/doi.org\/10.1145\/2939672.2939745","key":"967_CR8","DOI":"10.1145\/2939672.2939745"},{"key":"967_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-021-00774-6","author":"L Du","year":"2020","unstructured":"Du L, Chen S, Gao S, Yang W (2020) Nonsubmodular constrained profit maximization from increment perspective. J Comb Optim. https:\/\/doi.org\/10.1007\/s10878-021-00774-6","journal-title":"J Comb Optim"},{"key":"967_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-92681-6_27","volume-title":"Combinatorial optimization and applications","author":"L Du","year":"2021","unstructured":"Du L, Yang W, Gao S (2021) Generalized self-profit maximization in attribute networks. In: Du DZ, Du D, Wu C, Xu D (eds) Combinatorial optimization and applications. Springer, Cham, pp 333\u2013347. https:\/\/doi.org\/10.1007\/978-3-030-92681-6_27"},{"doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) Celf++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, WWW\u201911. Association for Computing Machinery, New York, pp 47\u201348. https:\/\/doi.org\/10.1145\/1963192.1963217","key":"967_CR11","DOI":"10.1145\/1963192.1963217"},{"doi-asserted-by":"publisher","unstructured":"He X, Kempe D (2014) Stability of influence maximization. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining\u2014KDD\u201914. ACM Press, New York, pp 1256\u20131265. https:\/\/doi.org\/10.1145\/2623330.2623746","key":"967_CR12","DOI":"10.1145\/2623330.2623746"},{"issue":"2","key":"967_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/s10489-019-01529-x","volume":"50","author":"H Huang","year":"2020","unstructured":"Huang H, Shen H, Meng Z (2020) Community-based influence maximization in attributed networks. Appl Intell 50(2):354\u2013364. https:\/\/doi.org\/10.1007\/s10489-019-01529-x","journal-title":"Appl Intell"},{"doi-asserted-by":"publisher","unstructured":"Huzhang G, Huang X, Zhang S, Bei X (2017) Online roommate allocation problem. In: Proceedings of the twenty-sixth international joint conference on artificial intelligence, IJCAI-17, pp 235\u2013241. https:\/\/doi.org\/10.24963\/ijcai.2017\/34","key":"967_CR14","DOI":"10.24963\/ijcai.2017\/34"},{"doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 37\u2013146. https:\/\/doi.org\/10.1145\/956750.956769","key":"967_CR15","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) KONECT\u2014the Koblenz network collection. In: Proc. Int. Conf. on world wide web companion, pp 1343\u20131350. https:\/\/doi.org\/10.1145\/2487788.2488173","key":"967_CR16","DOI":"10.1145\/2487788.2488173"},{"doi-asserted-by":"publisher","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, KDD\u201907. Association for Computing Machinery, New York, pp 420-429. https:\/\/doi.org\/10.1145\/1281192.1281239","key":"967_CR17","DOI":"10.1145\/1281192.1281239"},{"doi-asserted-by":"publisher","unstructured":"Li H, Bhowmick SS, Cui J, Gao Y, Ma J (2015) Getreal: towards realistic selection of influence maximization strategies in competitive networks. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, SIGMOD\u201915. Association for Computing Machinery, New York, pp 1525\u20131537. https:\/\/doi.org\/10.1145\/2723372.2723710","key":"967_CR18","DOI":"10.1145\/2723372.2723710"},{"key":"967_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.10.015","author":"H Li","year":"2017","unstructured":"Li H, Pan L, Wu P (2017) Dominated competitive influence maximization with time-critical and time-delayed diffusion in social networks. J Comput Sci. https:\/\/doi.org\/10.1016\/j.jocs.2017.10.015","journal-title":"J Comput Sci"},{"doi-asserted-by":"publisher","unstructured":"Lin SC, Lin SD, Chen MS (2015) A learning-based framework to handle multi-round multi-party influence maximization on social networks. pp 695\u2013704. https:\/\/doi.org\/10.1145\/2783258.2783392","key":"967_CR20","DOI":"10.1145\/2783258.2783392"},{"issue":"2","key":"967_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu W, Chen W, Lakshmanan LVS (2015) From competition to complementarity: comparative influence diffusion and maximization. Proc VLDB Endow 9(2):60\u201371. https:\/\/doi.org\/10.14778\/2850578.2850581","journal-title":"Proc VLDB Endow"},{"doi-asserted-by":"crossref","unstructured":"Masucci A, Silva A (2014) Strategic resource allocation for competitive influence in social networks","key":"967_CR22","DOI":"10.1109\/ALLERTON.2014.7028557"},{"doi-asserted-by":"publisher","unstructured":"Masucci AM, Silva A (2017) Advertising competitions in social networks. https:\/\/doi.org\/10.23919\/ACC.2017.7963668","key":"967_CR23","DOI":"10.23919\/ACC.2017.7963668"},{"issue":"1","key":"967_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/TASE.2010.2052042","volume":"8","author":"R Narayanam","year":"2011","unstructured":"Narayanam R, Narahari Y (2011) A shapley value-based approach to discover influential nodes in social networks. IEEE Trans Automat Sci Eng 8(1):130\u2013147. https:\/\/doi.org\/10.1109\/TASE.2010.2052042","journal-title":"IEEE Trans Automat Sci Eng"},{"key":"967_CR25","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"Shang J, Zhou S, Li X, Liu L, Wu H (2017) CoFIM: a community-based framework for influence maximization on large-scale networks. Knowl Based Syst 117:88\u2013100. https:\/\/doi.org\/10.1016\/j.knosys.2016.09.029","journal-title":"Knowl Based Syst"},{"doi-asserted-by":"publisher","unstructured":"Shi Q, Wang C, Ye D, Chen J, Feng Y, Chen C (2019) Adaptive influence blocking: minimizing the negative spread by observation-based policies. In: 2019 IEEE 35th international conference on data engineering (ICDE), pp 1502\u20131513. https:\/\/doi.org\/10.1109\/ICDE.2019.00135","key":"967_CR26","DOI":"10.1109\/ICDE.2019.00135"},{"key":"967_CR27","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2021.03.036","volume":"868","author":"Q Shi","year":"2021","unstructured":"Shi Q, Wang C, Ye D, Chen J, Zhou S, Feng Y, Chen C, Huang Y (2021) Profit maximization for competitive social advertising. Theor Comput Sci 868:12\u201329. https:\/\/doi.org\/10.1016\/j.tcs.2021.03.036","journal-title":"Theor Comput Sci"},{"issue":"013","key":"967_CR28","first-page":"85","volume":"055","author":"J Song","year":"2019","unstructured":"Song J, Liu Y, Guo L, Xuan P (2019) Research on social network propagation model and influence maximization algorithm based on emotion. J Comb Optim 055(013):85\u201392","journal-title":"J Comb Optim"},{"doi-asserted-by":"crossref","unstructured":"Sun L, Huang W, Yu PS, Chen W (2018) Multi-round influence maximization (extended version)","key":"967_CR29","DOI":"10.1145\/3219819.3220101"},{"issue":"1","key":"967_CR30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.orl.2019.10.013","volume":"48","author":"S Tang","year":"2020","unstructured":"Tang S, Yuan J (2020) Influence maximization with partial feedback. Oper Res Lett 48(1):24\u201328. https:\/\/doi.org\/10.1016\/j.orl.2019.10.013","journal-title":"Oper Res Lett"},{"doi-asserted-by":"publisher","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD international conference on management of data, SIGMOD\u201915. Association for Computing Machinery, New York, pp 1539\u20131554. https:\/\/doi.org\/10.1145\/2723372.2723734","key":"967_CR31","DOI":"10.1145\/2723372.2723734"},{"doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Yuan J (2017) Towards profit maximization for online social network providers. arXiv:1712.08963","key":"967_CR32","DOI":"10.1109\/ICNP.2016.7784445"},{"issue":"6","key":"967_CR33","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 (2018) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng 30(6):1095\u20131108. https:\/\/doi.org\/10.1109\/TKDE.2017.2787757","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"4","key":"967_CR34","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/LCSYS.2018.2846185","volume":"2","author":"VS Varma","year":"2018","unstructured":"Varma VS, Mor\u0103rescu IC, Lasaulce S, Martin S (2018) Marketing resource allocation in duopolies over social networks. IEEE Control Syst Lett 2(4):593\u2013598. https:\/\/doi.org\/10.1109\/LCSYS.2018.2846185","journal-title":"IEEE Control Syst Lett"},{"issue":"4","key":"967_CR35","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1109\/LCSYS.2019.2919959","volume":"3","author":"VS Varma","year":"2019","unstructured":"Varma VS, Lasaulce S, Mounthanyvong J, Mor\u0103rescu IC (2019) Allocating marketing resources over social networks: a long-term analysis. IEEE Control Syst Lett 3(4):1002\u20131007. https:\/\/doi.org\/10.1109\/LCSYS.2019.2919959","journal-title":"IEEE Control Syst Lett"},{"key":"967_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jlumin.2017.06.027","volume":"192","author":"X Wang","year":"2017","unstructured":"Wang X, Xu J, Sun Y, Zhu Z, You Z, Tu C (2017) Near infrared passively Q-switched solid state laser based on Sb2Te3 topological insulator saturable absorber. J Lumin 192:1\u20135. https:\/\/doi.org\/10.1016\/j.jlumin.2017.06.027","journal-title":"J Lumin"},{"key":"967_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0607-9","author":"R Yan","year":"2019","unstructured":"Yan R, Zhu Y, Li D, Zilong Y (2019) Minimum cost seed set for threshold influence problem under competitive models. World Wide Web. https:\/\/doi.org\/10.1007\/s11280-018-0607-9","journal-title":"World Wide Web"},{"doi-asserted-by":"publisher","unstructured":"Yu H, Kim SK, Kim J (2013) Scalable and parallelizable processing of influence maximization for large-scale social networks? In: Proceedings of the 2013 IEEE international conference on data engineering (ICDE 2013), ICDE\u201913. IEEE Computer Society, USA, pp 266\u2013277. https:\/\/doi.org\/10.1109\/ICDE.2013.6544831","key":"967_CR38","DOI":"10.1109\/ICDE.2013.6544831"},{"doi-asserted-by":"publisher","unstructured":"Yuan J, Tang SJ (2017) Adaptive discount allocation in social networks. In: Proceedings of the 18th ACM international symposium on mobile ad hoc networking and computing, Mobihoc\u201917. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/3084041.3084043","key":"967_CR39","DOI":"10.1145\/3084041.3084043"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00967-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00967-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00967-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T15:01:14Z","timestamp":1744210874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00967-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,21]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["967"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00967-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,12,21]]},"assertion":[{"value":"15 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there are no conflict of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"36"}}