{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:05:15Z","timestamp":1765544715276,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"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":[[2019,7,25]]},"DOI":"10.1145\/3292500.3332285","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"3185-3186","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Adaptive Influence Maximization"],"prefix":"10.1145","author":[{"given":"Bogdan","family":"Cautis","sequence":"first","affiliation":[{"name":"LRI, Universit\u00e9 Paris-Sud, Orsay, France"}]},{"given":"Silviu","family":"Maniu","sequence":"additional","affiliation":[{"name":"LRI, Universit\u00e9 Paris-Sud, Orsay, France"}]},{"given":"Nikolaos","family":"Tziortziotis","sequence":"additional","affiliation":[{"name":"Tradelab and LRI, Universit\u00e9 Paris-Sud, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035924"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3162007"},{"volume-title":"Prediction, Learning, and Games","author":"Cesa-Bianchi Nicolo","key":"e_1_3_2_2_3_1","unstructured":"Nicolo Cesa-Bianchi and Gabor Lugosi . 2006. Prediction, Learning, and Games . Cambridge University Press . Nicolo Cesa-Bianchi and Gabor Lugosi. 2006. Prediction, Learning, and Games. Cambridge University Press."},{"key":"e_1_3_2_2_4_1","unstructured":"Wei Chen Yajun Wang and Yang Yuan. 2013. Combinatorial Multi-armed Bandit: General Framework Results and Applications. In ICML.   Wei Chen Yajun Wang and Yang Yuan. 2013. Combinatorial Multi-armed Bandit: General Framework Results and Applications. In ICML."},{"key":"e_1_3_2_2_5_1","first-page":"1","article-title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","volume":"42","author":"Golovin D.","year":"2011","unstructured":"D. Golovin and A. Krause . 2011 . Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization . J. Artif. Int. Res. , Vol. 42 , 1 (Sept. 2011), 427--486. D. Golovin and A. Krause. 2011. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. J. Artif. Int. Res., Vol. 42, 1 (Sept. 2011), 427--486.","journal-title":"J. Artif. Int. Res."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213883"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_9_1","volume-title":"Theory of Computing","volume":"11","author":"Kempe David","year":"2015","unstructured":"David Kempe , Jon M. Kleinberg , and \u00c9 va Tardos. 2015 . Maximizing the Spread of Influence through a Social Network . Theory of Computing , Vol. 11 (2015). David Kempe, Jon M. Kleinberg, and \u00c9 va Tardos. 2015. Maximizing the Spread of Influence through a Social Network. Theory of Computing, Vol. 11 (2015)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"P. Lagr\u00e9e O. Capp\u00e9 B. Cautis and S. Maniu. 2017. Effective Large-Scale Online Influence Maximization. In ICDM.  P. Lagr\u00e9e O. Capp\u00e9 B. Cautis and S. Maniu. 2017. Effective Large-Scale Online Influence Maximization. In ICDM.","DOI":"10.1109\/ICDM.2017.118"},{"key":"e_1_3_2_2_11_1","volume-title":"Algorithms for Online Influencer Marketing. ACM TKDD","author":"Lagr\u00e9e P.","year":"2019","unstructured":"P. Lagr\u00e9e , O. Capp\u00e9 , B. Cautis , and S. Maniu . 2019. Algorithms for Online Influencer Marketing. ACM TKDD ( 2019 ). P. Lagr\u00e9e, O. Capp\u00e9, B. Cautis, and S.Maniu. 2019. Algorithms for Online Influencer Marketing. ACM TKDD (2019)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"e_1_3_2_2_13_1","volume-title":"Adaptive Submodular Influence Maximization with Myopic Feedback. ASONAM","author":"Salha Guillaume","year":"2018","unstructured":"Guillaume Salha , Nikolaos Tziortziotis , and Michalis Vazirgiannis . 2018. Adaptive Submodular Influence Maximization with Myopic Feedback. ASONAM ( 2018 ). Guillaume Salha, Nikolaos Tziortziotis, and Michalis Vazirgiannis. 2018. Adaptive Submodular Influence Maximization with Myopic Feedback. ASONAM (2018)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220101"},{"key":"e_1_3_2_2_15_1","unstructured":"S. Vaswani B. Kveton Z. Wen M. Ghavamzadeh L. Lakshmanan and M. Schmidt. 2017. Diffusion Independent Semi-Bandit Influence Maximization. In ICML.   S. Vaswani B. Kveton Z. Wen M. Ghavamzadeh L. Lakshmanan and M. Schmidt. 2017. Diffusion Independent Semi-Bandit Influence Maximization. In ICML."},{"key":"e_1_3_2_2_16_1","volume-title":"Social Networks: Why Commit when You can Adapt? CoRR","author":"Vaswani S.","year":"2016","unstructured":"S. Vaswani and L. Lakshmanan . 2016 . Adaptive Influence Maximization in Social Networks: Why Commit when You can Adapt? CoRR (2016). S. Vaswani and L. Lakshmanan. 2016. Adaptive Influence Maximization in Social Networks: Why Commit when You can Adapt? CoRR (2016)."},{"volume-title":"Influence Maximization with Bandits. In Workshop NIPS.","author":"Vaswani S.","key":"e_1_3_2_2_17_1","unstructured":"S. Vaswani , V.S. Lakshmanan , and M. Schmidt . 2015 . Influence Maximization with Bandits. In Workshop NIPS. S. Vaswani, V.S. Lakshmanan, and M. Schmidt. 2015. Influence Maximization with Bandits. In Workshop NIPS."},{"key":"e_1_3_2_2_18_1","unstructured":"Z. Wen B. Kveton and M. Valko. 2016. Influence Maximization with Semi-Bandit Feedback. Technical Report.  Z. Wen B. Kveton and M. Valko. 2016. Influence Maximization with Semi-Bandit Feedback. Technical Report."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Jing Yuan and Shaojie Tang. 2017. No Time to Observe: Adaptive Influence Maximization with Partial Feedback. In IJCAI.   Jing Yuan and Shaojie Tang. 2017. No Time to Observe: Adaptive Influence Maximization with Partial Feedback. In IJCAI.","DOI":"10.24963\/ijcai.2017\/546"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Anchorage AK USA","acronym":"KDD '19"},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3332285","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3332285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:25:56Z","timestamp":1750206356000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3332285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":19,"alternative-id":["10.1145\/3292500.3332285","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3332285","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}