{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:13:59Z","timestamp":1755839639633},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:p>The social network host has knowledge of the network structure and user characteristics and can earn a profit by providing merchants with viral marketing campaigns. We investigate the problem of<jats:italic>host profit maximization<\/jats:italic>by leveraging performance incentives and user flexibility. To incentivize the host's performance, we propose setting a desired influence threshold that would allow the host to receive full payment, with the possibility of a small bonus for exceeding the threshold. Unlike existing works that assume a user's choice is frozen once they are activated, we introduce the Dynamic State Switching model to capture<jats:italic>\"comparative shopping\"<\/jats:italic>behavior from an economic perspective, in which users have the flexibilities to change their minds about which product to adopt based on the accumulated influence and propaganda strength of each product. In addition, the incentivized cost of a user serving as an influence source is treated as a negative part of the host's profit.<\/jats:p><jats:p>The<jats:italic>host profit maximization<\/jats:italic>problem is NP-hard, submodular, and non-monotone. To address this challenge, we propose an efficient greedy algorithm and devise a scalable version with an approximation guarantee to select the seed sets. As a side contribution, we develop two seed allocation algorithms to balance the distribution of adoptions among merchants with small profit sacrifice. Through extensive experiments on four real-world social networks, we demonstrate that our methods are effective and scalable.<\/jats:p>","DOI":"10.14778\/3617838.3617843","type":"journal-article","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:07:41Z","timestamp":1701709661000},"page":"51-64","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Host Profit Maximization: Leveraging Performance Incentives and User Flexibility"],"prefix":"10.14778","volume":"17","author":[{"given":"Xueqin","family":"Chang","sequence":"first","affiliation":[{"name":"Zhejiang University"}]},{"given":"Xiangyu","family":"Ke","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]},{"given":"Lu","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]},{"given":"Congcong","family":"Ge","sequence":"additional","affiliation":[{"name":"Huawei Cloud Computing Technologies Co., Ltd"}]},{"given":"Ziheng","family":"Wei","sequence":"additional","affiliation":[{"name":"Huawei Cloud Computing Technologies Co., Ltd"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]}],"member":"320","published-online":{"date-parts":[[2023,12,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Apple. 2022. Retrieved September 5 2023 from https:\/\/www.apple.com\/newsroom\/2022\/09\/apple-introduces-iphone-14-and-iphone-14-plus\/ Apple. 2022. Retrieved September 5 2023 from https:\/\/www.apple.com\/newsroom\/2022\/09\/apple-introduces-iphone-14-and-iphone-14-plus\/"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137635"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752950"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 2019 ACM SIGMOD International Conference on Management of Data. 1078--1095","author":"Banerjee Prithu","year":"2019","unstructured":"Prithu Banerjee , Wei Chen , and Laks VS Lakshmanan . 2019 . Maximizing welfare in social networks under a utility driven influence diffusion model . In Proceedings of the 2019 ACM SIGMOD International Conference on Management of Data. 1078--1095 . Prithu Banerjee, Wei Chen, and Laks VS Lakshmanan. 2019. Maximizing welfare in social networks under a utility driven influence diffusion model. In Proceedings of the 2019 ACM SIGMOD International Conference on Management of Data. 1078--1095."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3436905.3436920"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 81--90","author":"Barbieri Nicola","year":"2012","unstructured":"Nicola Barbieri , Francesco Bonchi , and Giuseppe Manco . 2012 . Topic-Aware Social Influence Propagation Models . In Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 81--90 . Nicola Barbieri, Francesco Bonchi, and Giuseppe Manco. 2012. Topic-Aware Social Influence Propagation Models. In Proceedings of the 2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 81--90."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634144"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1940179.1940229"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/130929205"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Xueqin Chang Xiangyu Ke Chen Lu Congcong Ge Ziheng Wei and Yunjun Gao. 2023. Host Profit Maximization: Leveraging Performance Incentives and User Flexibility. https:\/\/github.com\/ZJU-DAILY\/HPM Xueqin Chang Xiangyu Ke Chen Lu Congcong Ge Ziheng Wei and Yunjun Gao. 2023. Host Profit Maximization: Leveraging Performance Incentives and User Flexibility. https:\/\/github.com\/ZJU-DAILY\/HPM","DOI":"10.14778\/3617838.3617843"},{"key":"e_1_2_1_12_1","volume-title":"Google Research: 2 in 3 UK Online Shoppers Compare Before They Buy. Retrieved","year":"2023","unstructured":"Charged. 2022. Google Research: 2 in 3 UK Online Shoppers Compare Before They Buy. Retrieved September 5, 2023 from https:\/\/www.chargedretail.co.uk\/2022\/11\/15\/google-research-2-in-3-uk-online-shoppers-compare-before-they-buy\/ Charged. 2022. Google Research: 2 in 3 UK Online Shoppers Compare Before They Buy. Retrieved September 5, 2023 from https:\/\/www.chargedretail.co.uk\/2022\/11\/15\/google-research-2-in-3-uk-online-shoppers-compare-before-they-buy\/"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_15_1","volume-title":"2010 IEEE International Conference on Data Mining (ICDM). IEEE, 88--97","author":"Chen Wei","year":"2010","unstructured":"Wei Chen , Yifei Yuan , and Li Zhang . 2010 . Scalable influence maximization in social networks under the linear threshold model . In 2010 IEEE International Conference on Data Mining (ICDM). IEEE, 88--97 . Wei Chen, Yifei Yuan, and Li Zhang. 2010. Scalable influence maximization in social networks under the linear threshold model. In 2010 IEEE International Conference on Data Mining (ICDM). IEEE, 88--97."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/578533"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 2167--2181","author":"Guo Qintian","year":"2020","unstructured":"Qintian Guo , Sibo Wang , Zhewei Wei , and Ming Chen . 2020 . Influence maximization revisited: Efficient reverse reachable set generation with bound tightened . In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 2167--2181 . Qintian Guo, Sibo Wang, Zhewei Wei, and Ming Chen. 2020. Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. In Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data. 2167--2181."},{"key":"e_1_2_1_19_1","volume-title":"Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems (TODS)","author":"Guo Qintian","year":"2022","unstructured":"Qintian Guo , Sibo Wang , Zhewei Wei , Wenqing Lin , and Jing Tang . 2022. Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems (TODS) ( 2022 ). Qintian Guo, Sibo Wang, Zhewei Wei, Wenqing Lin, and Jing Tang. 2022. Influence Maximization Revisited: Efficient Sampling with Bound Tightened. ACM Transactions on Database Systems (TODS) (2022)."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 671--684","author":"Han Kai","year":"2021","unstructured":"Kai Han , Benwei Wu , Jing Tang , Shuang Cui , Cigdem Aslay , and Laks VS Lakshmanan . 2021 . Efficient and effective algorithms for revenue maximization in social advertising . In Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 671--684 . Kai Han, Benwei Wu, Jing Tang, Shuang Cui, Cigdem Aslay, and Laks VS Lakshmanan. 2021. Efficient and effective algorithms for revenue maximization in social advertising. In Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 671--684."},{"key":"e_1_2_1_21_1","volume-title":"International Conference on Machine Learning. PMLR, 2634--2643","author":"Harshaw Chris","year":"2019","unstructured":"Chris Harshaw , Moran Feldman , Justin Ward , and Amin Karbasi . 2019 . Sub-modular maximization beyond non-negativity: Guarantees, fast algorithms, and applications . In International Conference on Machine Learning. PMLR, 2634--2643 . Chris Harshaw, Moran Feldman, Justin Ward, and Amin Karbasi. 2019. Sub-modular maximization beyond non-negativity: Guarantees, fast algorithms, and applications. In International Conference on Machine Learning. PMLR, 2634--2643."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_2_1_23_1","unstructured":"Huawei. 2022. Retrieved September 5 2023 from https:\/\/consumer.huawei.com\/en\/phones\/mate50-pro\/ Huawei. 2022. Retrieved September 5 2023 from https:\/\/consumer.huawei.com\/en\/phones\/mate50-pro\/"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1086\/209356"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467866"},{"key":"e_1_2_1_26_1","volume-title":"A new product adoption model with price, advertising, and uncertainty. Management science 31, 12","author":"Kalish Shlomo","year":"1985","unstructured":"Shlomo Kalish . 1985. A new product adoption model with price, advertising, and uncertainty. Management science 31, 12 ( 1985 ), 1569--1585. Shlomo Kalish. 1985. A new product adoption model with price, advertising, and uncertainty. Management science 31, 12 (1985), 1569--1585."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data. 1097--1111","author":"Ke Xiangyu","year":"2018","unstructured":"Xiangyu Ke , Arijit Khan , and Gao Cong . 2018 . Finding seeds and relevant tags jointly: For targeted influence maximization in social networks . In Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data. 1097--1111 . Xiangyu Ke, Arijit Khan, and Gao Cong. 2018. Finding seeds and relevant tags jointly: For targeted influence maximization in social networks. In Proceedings of the 2018 ACM SIGMOD International Conference on Management of Data. 1097--1111."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_29_1","volume-title":"2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 37--48","author":"Khan Arijit","year":"2016","unstructured":"Arijit Khan , Benjamin Zehnder , and Donald Kossmann . 2016 . Revenue maximization by viral marketing: A social network host's perspective . In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 37--48 . Arijit Khan, Benjamin Zehnder, and Donald Kossmann. 2016. Revenue maximization by viral marketing: A social network host's perspective. In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 37--48."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_31_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data. Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. 1525--1537","author":"Li Hui","year":"2015","unstructured":"Hui Li , Sourav S Bhowmick , Jiangtao Cui , Yunjun Gao , and Jianfeng Ma . 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. 1525--1537 . Hui Li, Sourav S Bhowmick, Jiangtao Cui, Yunjun Gao, and Jianfeng Ma. 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. 1525--1537."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_2_1_34_1","volume-title":"Campaign budgets for Your LinkedIn Ads. Retrieved","author":"In.","year":"2023","unstructured":"Linked In. 2022. Campaign budgets for Your LinkedIn Ads. Retrieved September 5, 2023 from https:\/\/business.linkedin.com\/marketing-solutions\/success\/best-practices\/maximize-your-budget LinkedIn. 2022. Campaign budgets for Your LinkedIn Ads. Retrieved September 5, 2023 from https:\/\/business.linkedin.com\/marketing-solutions\/success\/best-practices\/maximize-your-budget"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 928--936","author":"Lu Wei","year":"2013","unstructured":"Wei Lu , Francesco Bonchi , Amit Goyal , and Laks VS Lakshmanan . 2013 . The bang for the buck: fair competitive viral marketing from the host perspective . In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 928--936 . Wei Lu, Francesco Bonchi, Amit Goyal, and Laks VS Lakshmanan. 2013. The bang for the buck: fair competitive viral marketing from the host perspective. In Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. 928--936."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"e_1_2_1_37_1","volume-title":"2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 479--488","author":"Lu Wei","year":"2012","unstructured":"Wei Lu and Laks VS Lakshmanan . 2012 . Profit maximization over social networks . In 2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 479--488 . Wei Lu and Laks VS Lakshmanan. 2012. Profit maximization over social networks. In 2012 IEEE 12th International Conference on Data Mining (ICDM). IEEE, 479--488."},{"key":"e_1_2_1_38_1","volume-title":"Maximizing Time-aware Welfare for Mixed Items. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1044--1057","author":"Miao Xiaoye","year":"2022","unstructured":"Xiaoye Miao , Huanhuan Peng , Kai Chen , Yuchen Peng , Yunjun Gao , and Jianwei Yin . 2022 . Maximizing Time-aware Welfare for Mixed Items. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1044--1057 . Xiaoye Miao, Huanhuan Peng, Kai Chen, Yuchen Peng, Yunjun Gao, and Jianwei Yin. 2022. Maximizing Time-aware Welfare for Mixed Items. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1044--1057."},{"key":"e_1_2_1_39_1","volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal . 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis . Cambridge university press . Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33486-3_37"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"e_1_2_1_42_1","unstructured":"SamSung. 2022. Retrieved September 5 2023 from https:\/\/www.samsung.com\/global\/galaxy\/galaxy-z-flip4\/ SamSung. 2022. Retrieved September 5 2023 from https:\/\/www.samsung.com\/global\/galaxy\/galaxy-z-flip4\/"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.03.036"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3547305.3547324"},{"key":"e_1_2_1_45_1","volume-title":"Advertising on Snapchat: How pricing works. Retrieved","year":"2023","unstructured":"Snapchat. 2020. Advertising on Snapchat: How pricing works. Retrieved September 5, 2023 from https:\/\/forbusiness.snapchat.com\/blog\/advertising-on-snapchat-how-pricing-works Snapchat. 2020. Advertising on Snapchat: How pricing works. Retrieved September 5, 2023 from https:\/\/forbusiness.snapchat.com\/blog\/advertising-on-snapchat-how-pricing-works"},{"key":"e_1_2_1_46_1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.7441\/joc.2020.04.09","article-title":"The importance of online shopping behavior in the strategic management of e-commerce competitiveness","volume":"12","author":"Svatosova Veronika","year":"2020","unstructured":"Veronika Svatosova . 2020 . The importance of online shopping behavior in the strategic management of e-commerce competitiveness . Journal of Competitiveness 12 , 4 (2020), 143 . Veronika Svatosova. 2020. The importance of online shopping behavior in the strategic management of e-commerce competitiveness. Journal of Competitiveness 12, 4 (2020), 143.","journal-title":"Journal of Competitiveness"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551824"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183749"},{"key":"e_1_2_1_49_1","volume-title":"2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10","author":"Tang Jing","year":"2016","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2016 . Profit maximization for viral marketing in online social networks . In 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10 . Jing Tang, Xueyan Tang, and Junsong Yuan. 2016. Profit maximization for viral marketing in online social networks. In 2016 IEEE 24th International Conference on Network Protocols (ICNP). IEEE, 1--10."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2787757"},{"key":"e_1_2_1_51_1","volume-title":"IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1178--1186","author":"Tang Jing","year":"2018","unstructured":"Jing Tang , Xueyan Tang , and Junsong Yuan . 2018 . Towards profit maximization for online social network providers . In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1178--1186 . Jing Tang, Xueyan Tang, and Junsong Yuan. 2018. Towards profit maximization for online social network providers. In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1178--1186."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3450980.3450981"},{"key":"e_1_2_1_55_1","volume-title":"The Benefits of Comparison Shopping for Ecommerce Merchants. Retrieved","year":"2023","unstructured":"Wpromote. 2020. The Benefits of Comparison Shopping for Ecommerce Merchants. Retrieved September 5, 2023 from https:\/\/www.wpromote.com\/blog\/amazon-marketing\/the-benefits-of-comparison-shopping-for-ecommerce-merchants Wpromote. 2020. The Benefits of Comparison Shopping for Ecommerce Merchants. Retrieved September 5, 2023 from https:\/\/www.wpromote.com\/blog\/amazon-marketing\/the-benefits-of-comparison-shopping-for-ecommerce-merchants"},{"key":"e_1_2_1_56_1","volume-title":"Parallel greedy algorithm to multiple influence maximization in social network. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 3","author":"Wu Guanhao","year":"2021","unstructured":"Guanhao Wu , Xiaofeng Gao , Ge Yan , and Guihai Chen . 2021. Parallel greedy algorithm to multiple influence maximization in social network. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 3 ( 2021 ), 1--21. Guanhao Wu, Xiaofeng Gao, Ge Yan, and Guihai Chen. 2021. Parallel greedy algorithm to multiple influence maximization in social network. ACM Transactions on Knowledge Discovery from Data (TKDD) 15, 3 (2021), 1--21."},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882961"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348373"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 2115--2127","author":"Zhang Yipeng","year":"2021","unstructured":"Yipeng Zhang , Yuchen Li , Zhifeng Bao , Baihua Zheng , and HV Jagadish . 2021 . Minimizing the regret of an influence provider . In Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 2115--2127 . Yipeng Zhang, Yuchen Li, Zhifeng Bao, Baihua Zheng, and HV Jagadish. 2021. Minimizing the regret of an influence provider. In Proceedings of the 2021 ACM SIGMOD International Conference on Management of Data. 2115--2127."},{"key":"e_1_2_1_60_1","volume-title":"IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1160--1168","author":"Zhu Yuqing","year":"2018","unstructured":"Yuqing Zhu and Deying Li . 2018 . Host profit maximization for competitive viral marketing in billion-scale networks . In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1160--1168 . Yuqing Zhu and Deying Li. 2018. Host profit maximization for competitive viral marketing in billion-scale networks. In IEEE INFOCOM 2018-IEEE Conference on Computer Communications. IEEE, 1160--1168."},{"key":"e_1_2_1_61_1","volume-title":"2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, 1301--1306","author":"Zhu Yuqing","year":"2013","unstructured":"Yuqing Zhu , Zaixin Lu , Yuanjun Bi , Weili Wu , Yiwei Jiang , and Deying Li . 2013 . Influence and profit: Two sides of the coin . In 2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, 1301--1306 . Yuqing Zhu, Zaixin Lu, Yuanjun Bi, Weili Wu, Yiwei Jiang, and Deying Li. 2013. Influence and profit: Two sides of the coin. In 2013 IEEE 13th International Conference on Data Mining (ICDM). IEEE, 1301--1306."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3617838.3617843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T09:00:28Z","timestamp":1703667628000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3617838.3617843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":61,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["10.14778\/3617838.3617843"],"URL":"https:\/\/doi.org\/10.14778\/3617838.3617843","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"2023-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}