{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:54:12Z","timestamp":1775638452163,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,2,27]]},"DOI":"10.1145\/3539597.3570433","type":"proceedings-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T23:27:00Z","timestamp":1677108420000},"page":"733-741","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Learning and Maximizing Influence in Social Networks Under Capacity Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8875-5819","authenticated-orcid":false,"given":"Pritish","family":"Chakraborty","sequence":"first","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4147-9372","authenticated-orcid":false,"given":"Sayan","family":"Ranu","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Delhi, New Delhi, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2393-2834","authenticated-orcid":false,"given":"Krishna Sri Ipsit","family":"Mantri","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9062-3636","authenticated-orcid":false,"given":"Abir","family":"De","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752950"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Christian Borgs Michael Brautbar Jennifer Chayes and Brendan Lucier. 2014. Maximizing Social Influence in Nearly Optimal Time. In SODA. 946--957.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Vineet Chaoji Sayan Ranu Rajeev Rastogi and Rushi Bhatt. 2012. Recommendations to Boost Content Spread in Social Networks. In WWW. 529--538.","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Chi Wang and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. 1029--1038.","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Wei Chen Yifei Yuan and Li Zhang. 2010. Scalable influence maximization in social networks under the linear threshold model. In ICDM. 88--97.","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Suqi Cheng Huawei Shen Junming Huang Guoqing Zhang and Xueqi Cheng. 2013. Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In CIKM. 509--518.","DOI":"10.1145\/2505515.2505541"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2013.2290714"},{"key":"e_1_3_2_1_10_1","volume-title":"Deep submodular functions: Definitions and learning. Advances in Neural Information Processing Systems 29","author":"Dolhansky Brian W","year":"2016","unstructured":"Brian W Dolhansky and Jeff A Bilmes. 2016. Deep submodular functions: Definitions and learning. Advances in Neural Information Processing Systems 29 (2016)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Pedro Domingos and Matt Richardson. 2001. Mining the Network Value of Customers. In KDD. 57--66.","DOI":"10.1145\/502512.502525"},{"key":"e_1_3_2_1_12_1","volume-title":"Submodular functions and optimization","author":"Fujishige Satoru","unstructured":"Satoru Fujishige. 2005. Submodular functions and optimization. Elsevier."},{"key":"e_1_3_2_1_13_1","volume-title":"Minimizing a submodular function arising from a concave function. Discrete applied mathematics 92, 2--3","author":"Fujishige Satoru","year":"1999","unstructured":"Satoru Fujishige and Satoru Iwata. 1999. Minimizing a submodular function arising from a concave function. Discrete applied mathematics 92, 2--3 (1999), 211--215."},{"key":"e_1_3_2_1_14_1","volume-title":"International conference on machine learning. PMLR, 1263--1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263--1272."},{"key":"e_1_3_2_1_15_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2010","unstructured":"Amit Goyal, Francesco Bonchi, and Laks V.S. Lakshmanan. 2010. Learning Influence Probabilities in Social Networks. In WSDM. 241--250."},{"key":"e_1_3_2_1_16_1","volume-title":"Lakshmanan","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks V.S. Lakshmanan. 2011. CELF: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks. In WWW (Companion Volume). 47--48."},{"key":"e_1_3_2_1_17_1","volume-title":"Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM. 211--220.","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks VS Lakshmanan. 2011. Simpath: An efficient algorithm for influence maximization under the linear threshold model. In ICDM. 211--220."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_3_2_1_19_1","volume-title":"Inductive representation learning on large graphs. Advances in neural information processing systems 30","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. Advances in neural information processing systems 30 (2017)."},{"key":"e_1_3_2_1_20_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."},{"key":"e_1_3_2_1_21_1","unstructured":"Xinran He Guojie Song Wei Chen and Qingye Jiang. 2012. Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model. In SDM. 463--474."},{"key":"e_1_3_2_1_22_1","volume-title":"IRIE: Scalable and Robust Influence Maximization in Social Networks. In ICDM. 918--923.","author":"Jung Kyomin","year":"2012","unstructured":"Kyomin Jung, Wooram Heo, and Wei Chen. 2012. IRIE: Scalable and Robust Influence Maximization in Social Networks. In ICDM. 918--923."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon Kleinberg and \u00c9va Tardos. 2003. Maximizing the Spread of Influence Through a Social Network. In KDD. 137--146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Arijit Khan Benjamin Zehnder and Donald Kossmann. 2016. Revenue maximization by viral marketing: A social network host's perspective. In ICDE. 37--48.","DOI":"10.1109\/ICDE.2016.7498227"},{"key":"e_1_3_2_1_25_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_1_26_1","volume-title":"Variational graph auto-encoders. arXiv preprint arXiv:1611.07308","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Variational graph auto-encoders. arXiv preprint arXiv:1611.07308 (2016)."},{"key":"e_1_3_2_1_27_1","volume-title":"STRIP: Stream Learning of Influence Probabilities. In KDD. 275--283.","author":"Kutzkov Konstantin","year":"2013","unstructured":"Konstantin Kutzkov, Albert Bifet, Francesco Bonchi, and Aristides Gionis. 2013. STRIP: Stream Learning of Influence Probabilities. In KDD. 275--283."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"W. Lee J. Kim and H. Yu. 2012. CT-IC: Continuously Activated and Time-Restricted Independent Cascade Model for Viral Marketing. In ICDM. 960--965.","DOI":"10.1109\/ICDM.2012.40"},{"key":"e_1_3_2_1_29_1","volume-title":"Jeanne Van Briesen, and Natalie Glance","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne Van Briesen, and Natalie Glance. 2007. Cost-effective Outbreak Detection in Networks. In KDD. 420--429."},{"key":"e_1_3_2_1_30_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2002472.2002537"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"B. Liu G. Cong D. Xu and Y. Zeng. 2012. Time Constrained Influence Maximization in Social Networks. In ICDM. 439--448.","DOI":"10.1109\/ICDM.2012.158"},{"key":"e_1_3_2_1_33_1","volume-title":"Lakshmanan","author":"Lu Wei","year":"2013","unstructured":"Wei Lu, Francesco Bonchi, Amit Goyal, and Laks V. S. Lakshmanan. 2013. The bang for the buck: fair competitive viral marketing from the host perspective. In KDD. 928--936."},{"key":"e_1_3_2_1_34_1","first-page":"20000","article-title":"Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs","volume":"33","author":"Manchanda Sahil","year":"2020","unstructured":"Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2020. Gcomb: Learning budget-constrained combinatorial algorithms over billion-sized graphs. Advances in Neural Information Processing Systems 33 (2020), 20000--20011.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_35_1","volume-title":"Introduction to information retrieval","author":"Manning Christopher D","unstructured":"Christopher D Manning. 2008. Introduction to information retrieval. Syngress Publishing,."},{"key":"e_1_3_2_1_36_1","volume-title":"Dinh","author":"Nguyen Hung T.","year":"2016","unstructured":"Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks. In SIGMOD. 695--710."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Naoto Ohsaka Takuya Akiba Yuichi Yoshida and Ken-ichi Kawarabayashi. 2014. Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations. In AAAI. 138--144.","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"e_1_3_2_1_38_1","volume-title":"Multi-task learning for influence estimation and maximization","author":"Panagopoulos George","year":"2020","unstructured":"George Panagopoulos, Fragkiskos Malliaros, and Michalis Vazirgiannis. 2020. Multi-task learning for influence estimation and maximization. IEEE Transactions on Knowledge and Data Engineering (2020)."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Matthew Richardson and Pedro Domingos. 2002. Mining Knowledge-sharing Sites for Viral Marketing. In KDD. 61--70.","DOI":"10.1145\/775047.775057"},{"key":"e_1_3_2_1_40_1","unstructured":"Thomas C. Schelling. 1978. Micromotives and Macrobehavior."},{"key":"e_1_3_2_1_41_1","volume-title":"Deep learning in medical image analysis and multi-modal learning for clinical decision support","author":"Sudre Carole H","unstructured":"Carole H Sudre, Wenqi Li, Tom Vercauteren, Sebastien Ourselin, and M Jorge Cardoso. 2017. Generalised dice overlap as a deep learning loss function for highly unbalanced segmentations. In Deep learning in medical image analysis and multi-modal learning for clinical decision support. Springer, 240--248."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183749"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence Maximization in Near-Linear Time: A Martingale Approach. In SIGMOD. 1539--1554.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_3_2_1_45_1","volume-title":"Graph attention networks. stat 1050","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. stat 1050 (2017), 20."}],"event":{"name":"WSDM '23: The Sixteenth ACM International Conference on Web Search and Data Mining","location":"Singapore Singapore","acronym":"WSDM '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570433","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3539597.3570433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:14Z","timestamp":1750186934000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3539597.3570433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":45,"alternative-id":["10.1145\/3539597.3570433","10.1145\/3539597"],"URL":"https:\/\/doi.org\/10.1145\/3539597.3570433","relation":{},"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"2023-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}