{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:06:32Z","timestamp":1773788792722,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"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":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2020,11,30]]},"abstract":"<jats:p>Viral marketing campaigns are often negatively affected by overexposure. Overexposure occurs when users become less likely to favor a promoted product after receiving information about the product from too large a fraction of their friends. Yet, existing influence diffusion models do not take overexposure into account, effectively overestimating the number of users who favor the product and diffuse information about it. In this work, we propose the first influence diffusion model that captures overexposure. In our model, Latency Aware Independent Cascade Model with Overexposure (LAICO), the activation probability of a node representing a user is multiplied (discounted) by an overexposure score, which is calculated based on the ratio between the estimated and the maximum possible number of attempts performed to activate the node. We also study the influence maximization problem under LAICO. Since the spread function in LAICO is non-submodular, algorithms for submodular maximization are not appropriate to address the problem. Therefore, we develop an approximation algorithm that exploits monotone submodular upper and lower bound functions of spread, and a heuristic that aims to maximize a proxy function of spread iteratively. Our experiments show the effectiveness and efficiency of our algorithms.<\/jats:p>","DOI":"10.1145\/3408315","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T11:49:08Z","timestamp":1601984948000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Overexposure-Aware Influence Maximization"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-5061","authenticated-orcid":false,"given":"Grigorios","family":"Loukides","sequence":"first","affiliation":[{"name":"King\u2019s College London, Aldwych, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Gwadera","sequence":"additional","affiliation":[{"name":"Cardiff University, Roath, Cardiff, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shing-Wan","family":"Chang","sequence":"additional","affiliation":[{"name":"Middlesex University, The Burroughs, Hendon, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"A. Awan. 2015. Less is more: You are about to receive less email from LinkedIn. Retrieved from https:\/\/blog.linkedin.com\/2015\/07\/27\/less-email-from-linkedin?sf11404748=1. A. Awan. 2015. Less is more: You are about to receive less email from LinkedIn. Retrieved from https:\/\/blog.linkedin.com\/2015\/07\/27\/less-email-from-linkedin?sf11404748=1."},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R. Abebe L. A. Adamic and J. Kleinberg. 2018. Mitigating overexposue in viral marketing. In AAAI. R. Abebe L. A. Adamic and J. Kleinberg. 2018. Mitigating overexposue in viral marketing. In AAAI.","DOI":"10.1609\/aaai.v32i1.11282"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"F. Alkemade and C. Castaldi. 2005. Strategies for the diffusion of innovations on social networks. Comp. Econ. 25 1 (2005). F. Alkemade and C. Castaldi. 2005. Strategies for the diffusion of innovations on social networks. Comp. Econ. 25 1 (2005).","DOI":"10.1007\/s10614-005-6245-1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00087-6"},{"key":"e_1_2_1_5_1","unstructured":"J. A. Bilmes and W. Bai. 2017. Deep submodular functions. CoRR abs\/1701.08939 (2017). J. A. Bilmes and W. Bai. 2017. Deep submodular functions. CoRR abs\/1701.08939 (2017)."},{"key":"e_1_2_1_6_1","unstructured":"K. Bontcheva G. Gorrell and B. Wessels. 2013. Social media and information overload. CoRR abs\/1306.0813 (2013). K. Bontcheva G. Gorrell and B. Wessels. 2013. Social media and information overload. CoRR abs\/1306.0813 (2013)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"C. Borgs M. Brautbar J. Chayes and B. Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA. C. Borgs M. Brautbar J. Chayes and B. Lucier. 2014. Maximizing social influence in nearly optimal time. In SODA.","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"N. Buchbinder M. Feldman J. Naor and R. Schwartz. 2014. Submodular maximization with cardinality constraints. In SODA. N. Buchbinder M. Feldman J. Naor and R. Schwartz. 2014. Submodular maximization with cardinality constraints. In SODA.","DOI":"10.1137\/1.9781611973730.80"},{"key":"e_1_2_1_9_1","unstructured":"W. Chen W. Lu and N. Zhang. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI. W. Chen W. Lu and N. Zhang. 2012. Time-critical influence maximization in social networks with time-delayed diffusion process. In AAAI."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"W. Chen C. Wang and Y. Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In KDD. 1029--1038. W. Chen C. Wang and Y. 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_2_1_11_1","doi-asserted-by":"crossref","unstructured":"W. Chen Y. Wang and S. Yang. 2009. Efficient influence maximization in social networks. In KDD. 199--208. W. Chen Y. Wang and S. Yang. 2009. Efficient influence maximization in social networks. In KDD. 199--208.","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"S. Feng X. Chen G. Cong Y. Zeng Y. M. Chee and Y. Xiang. 2014. Influence maximization with novelty decay in social networks. In AAAI. S. Feng X. Chen G. Cong Y. Zeng Y. M. Chee and Y. Xiang. 2014. Influence maximization with novelty decay in social networks. In AAAI.","DOI":"10.1609\/aaai.v28i1.8729"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011122126881"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1086\/226707"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"R. Gwadera and G. Loukides. 2017. Cost-effective viral marketing in the latency aware independent cascade model. In PAKDD. 251--265. R. Gwadera and G. Loukides. 2017. Cost-effective viral marketing in the latency aware independent cascade model. In PAKDD. 251--265.","DOI":"10.1007\/978-3-319-57454-7_20"},{"key":"e_1_2_1_17_1","unstructured":"R. Iyer and J. Bilmes. 2012. Algorithms for approximate minimization of the difference between submodular functions with applications. In UAI. R. Iyer and J. Bilmes. 2012. Algorithms for approximate minimization of the difference between submodular functions with applications. In UAI."},{"key":"e_1_2_1_18_1","doi-asserted-by":"crossref","unstructured":"J. Jeong and S. Moon. 2014. Invite your friends and get rewards: Dynamics of incentivized friend invitation in kakaotalk mobile games. In ACM COSN. J. Jeong and S. Moon. 2014. Invite your friends and get rewards: Dynamics of incentivized friend invitation in kakaotalk mobile games. In ACM COSN.","DOI":"10.1145\/2660460.2660468"},{"key":"e_1_2_1_19_1","first-page":"72","article-title":"Adaptive experimentation in interactive marketing: The case of viral marketing at Plaxo","volume":"21","author":"Kalyanam K.","year":"2007","journal-title":"J. of Int. Marketing"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","unstructured":"D. Kempe J. Kleinberg and E. Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. D. Kempe J. Kleinberg and E. Tardos. 2003. Maximizing the spread of influence through a social network. In KDD.","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514888.1514892"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"A. Krause and D. Golovin. 2013. Submodular function maximization. In Tractability. A. Krause and D. Golovin. 2013. Submodular function maximization. In Tractability.","DOI":"10.1017\/CBO9781139177801.004"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"e_1_2_1_25_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. B. Liu G. Cong D. Xu and Y. Zeng. 2012. Time constrained influence maximization in social networks. In ICDM.","DOI":"10.1109\/ICDM.2012.158"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-017-0082-x"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"J. J. Louviere D. A. Hensher and J. D. Swait. 2000. Stated Choice Methods Analysis and Applications. J. J. Louviere D. A. Hensher and J. D. Swait. 2000. Stated Choice Methods Analysis and Applications.","DOI":"10.1017\/CBO9780511753831"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"e_1_2_1_29_1","unstructured":"M. Minoux. 1978. Accelerated greedy algorithms for maximizing submodular set functions. In Optimization Techniques. M. Minoux. 1978. Accelerated greedy algorithms for maximizing submodular set functions. In Optimization Techniques."},{"key":"e_1_2_1_30_1","unstructured":"M. Mitrovic M. Bun A. Krause and A. Karbasi. 2017. Differentially private submodular maximization: Data summarization in disguise. In ICML. M. Mitrovic M. Bun A. Krause and A. Karbasi. 2017. Differentially private submodular maximization: Data summarization in disguise. In ICML."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"S. A. Myers C. Zhu and J. Leskovec. 2012. Information diffusion and external influence in networks. In KDD. 33--41. S. A. Myers C. Zhu and J. Leskovec. 2012. Information diffusion and external influence in networks. In KDD. 33--41.","DOI":"10.1145\/2339530.2339540"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"N. Ohsaka Y. Yamaguchi N. Kakimura and K. Kawarabayashi. 2016. Maximizing time-decaying influence in social networks. In ECML\/PKDD. N. Ohsaka Y. Yamaguchi N. Kakimura and K. Kawarabayashi. 2016. Maximizing time-decaying influence in social networks. In ECML\/PKDD.","DOI":"10.1007\/978-3-319-46128-1_9"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.elerap.2018.11.006"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"C. C. Pugh. 2015. Real Mathematical Analysis. C. C. Pugh. 2015. Real Mathematical Analysis.","DOI":"10.1007\/978-3-319-17771-7"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"D. M. Romero B. Meeder and J. Kleinberg. 2011. Differences in the mechanics of information diffusion across topics. In WWW. D. M. Romero B. Meeder and J. Kleinberg. 2011. Differences in the mechanics of information diffusion across topics. In WWW.","DOI":"10.1145\/1963405.1963503"},{"key":"e_1_2_1_37_1","unstructured":"D. Simchi-Levi X. Chen and J. Bramel. 2005. Convexity and Supermodularity. Springer New York. D. Simchi-Levi X. Chen and J. Bramel. 2005. Convexity and Supermodularity. Springer New York."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/100783352"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Y. Tang Y. Shi and X. Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD. Y. Tang Y. Shi and X. Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In SIGMOD.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1140093"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2728064"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","unstructured":"L. Wu P. Sun Y. Fu Yanjie R. Hong X. Wang and M. Wang. 2019. A neural influence diffusion model for social recommendation. In SIGIR. 235--244. L. Wu P. Sun Y. Fu Yanjie R. Hong X. Wang and M. Wang. 2019. A neural influence diffusion model for social recommendation. In SIGIR. 235--244.","DOI":"10.1145\/3331184.3331214"},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Y. Zhou and L. Liu. 2013. Social influence based clustering of heterogeneous information networks. In KDD. 338--346. Y. Zhou and L. Liu. 2013. Social influence based clustering of heterogeneous information networks. In KDD. 338--346.","DOI":"10.1145\/2487575.2487640"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2873759"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Y. Zhu P. Yin D. Li and B. Lin. 2019. Strengthening the positive effect of viral marketing. In ICDCS. 1941--1950. Y. Zhu P. Yin D. Li and B. Lin. 2019. Strengthening the positive effect of viral marketing. In ICDCS. 1941--1950.","DOI":"10.1109\/ICDCS.2019.00192"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408315","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3408315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:39:02Z","timestamp":1750199942000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3408315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,11,30]]}},"alternative-id":["10.1145\/3408315"],"URL":"https:\/\/doi.org\/10.1145\/3408315","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"2020-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}