{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:04:50Z","timestamp":1775815490943,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/infcomw.2019.8845088","type":"proceedings-article","created":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T02:23:05Z","timestamp":1569291785000},"page":"365-371","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Influence Maximization Under Network Uncertainty"],"prefix":"10.1109","author":[{"given":"Soheil","family":"Eshghi","sequence":"first","affiliation":[{"name":"School of Engineering and Applied Science, Yale University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Setareh","family":"Maghsudi","sequence":"additional","affiliation":[{"name":"Technical University of Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerio","family":"Restocchi","sequence":"additional","affiliation":[{"name":"School of Informatics, The University of Edinburgh, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Stein","sequence":"additional","affiliation":[{"name":"Electronics and Computer Science, University of Southampton, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leandros","family":"Tassiulas","sequence":"additional","affiliation":[{"name":"School of Engineering and Applied Science, Yale University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref2","first-page":"150","article-title":"Influence maximization in the field: The arduous journey from emerging to deployed application","volume-title":"AAMAS17","author":"Yadav","year":"2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/546"},{"key":"ref5","first-page":"740","article-title":"Using social networks to aid homeless shelters: Dynamic influence maximization under uncertainty","volume-title":"AAMAS16","author":"Yadav","year":"2016"},{"key":"ref6","first-page":"1305","article-title":"Uncharted but not uninfluenced: Influence maximization with an uncertain network","volume-title":"AAMAS17","author":"Wilder","year":"2017"},{"key":"ref7","first-page":"67","article-title":"Prediction of information diffusion probabilities for independent cascade model","volume-title":"KES08. 2008","author":"Satio"},{"key":"ref8","first-page":"10","article-title":"Revealing graph bandits for maximizing local influence","volume-title":"AISTATS16","author":"Carpentier","year":"2016"},{"key":"ref9","first-page":"1414","article-title":"End-to-end influence maximization in the field","volume-title":"AAMAS18","author":"Wilder","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11585"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939745"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"ref17","volume-title":"Influence maximization with bandits","author":"Vaswani","year":"2015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2808797.2808885"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1198\/016214507000000446"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250811"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2006.10129115"},{"key":"ref22","first-page":"20","article-title":"Heuristic algorithms for influence maximization in partially observable social networks","volume-title":"SOCINF17","author":"Stein","year":"2017"}],"event":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","location":"Paris, France","start":{"date-parts":[[2019,4,29]]},"end":{"date-parts":[[2019,5,2]]}},"container-title":["IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8831168\/8845034\/08845088.pdf?arnumber=8845088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T12:03:05Z","timestamp":1709294585000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8845088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/infcomw.2019.8845088","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}