{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:55:57Z","timestamp":1772121357967,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819772377","type":"print"},{"value":"9789819772384","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-7238-4_22","type":"book-chapter","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:02:47Z","timestamp":1724774567000},"page":"342-359","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reachability-Aware Fair Influence Maximization"],"prefix":"10.1007","author":[{"given":"Wenyue","family":"Ma","sequence":"first","affiliation":[]},{"given":"Maximilian K.","family":"Egger","sequence":"additional","affiliation":[]},{"given":"Andreas","family":"Pavlogiannis","sequence":"additional","affiliation":[]},{"given":"Yuchen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1613\/jair.1.13367","volume":"73","author":"R Becker","year":"2022","unstructured":"Becker, R., D\u2019Angelo, G., Ghobadi, S., Gilbert, H.: Fairness in influence maximization through randomization. J. Artif. Intell. Res. 73, 1251\u20131283 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Brown, A.: Equality of Welfare, pp. 28\u201349. Palgrave Macmillan UK, London (2009)","DOI":"10.1057\/9780230244467_2"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp. 1029\u20131038 (2010)","DOI":"10.1145\/1835804.1835934"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: ICDM, pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Domingos, P.M., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57\u201366 (2001)","DOI":"10.1145\/502512.502525"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Eshghi, S., Maghsudi, S., Restocchi, V., Stein, S., Tassiulas, L.: Efficient influence maximization under network uncertainty. In: IEEE Conference on Computer Communications INFOCOM Workshops, pp. 365\u2013371 (2019)","DOI":"10.1109\/INFCOMW.2019.8845088"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Farnadi, G., Babaki, B., Gendreau, M.: A unifying framework for fairness-aware influence maximization. In: WebConf, pp. 714\u2013722 (2020)","DOI":"10.1145\/3366424.3383555"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Fish, B., Bashardoust, A., danah boyd, Friedler, S.A., Scheidegger, C., Venkatasubramanian, S.: Gaps in information access in social networks? In: WebConf, pp. 480\u2013490 (2019)","DOI":"10.1145\/3308558.3313680"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Fu, X., Bhatt, R.R., Basu, S., Pavan, A.: Multi-objective submodular optimization with approximate oracles and influence maximization. In: 2021 IEEE International Conference on Big Data (Big Data), pp. 328\u2013334 (2021)","DOI":"10.1109\/BigData52589.2021.9671756"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Fu, Z., et al.: Fairness-aware explainable recommendation over knowledge graphs. In: SIGIR, pp. 69\u201378 (2020)","DOI":"10.1145\/3397271.3401051"},{"key":"22_CR11","unstructured":"Garimella, K., Gionis, A., Parotsidis, N., Tatti, N.: Balancing information exposure in social networks. In: NeurIPS, pp. 4663\u20134671 (2017)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Garimella, K., Morales, G.D.F., Gionis, A., Mathioudakis, M.: Political discourse on social media: echo chambers, gatekeepers, and the price of bipartisanship. In: WebConf, pp. 913\u2013922. ACM (2018)","DOI":"10.1145\/3178876.3186139"},{"key":"22_CR13","unstructured":"Gershtein, S., Milo, T., Youngmann, B.: Multi-objective influence maximization. In: EDBT, pp. 145\u2013156 (2021)"},{"issue":"9","key":"22_CR14","first-page":"273","volume":"10","author":"K Huang","year":"2017","unstructured":"Huang, K., Wang, S., Bevilacqua, G.S., Xiao, X., Lakshmanan, L.V.S.: Revisiting the stop-and-stare algorithms for influence maximization. PVLDB 10(9), 273\u2013285 (2017)","journal-title":"PVLDB"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Bonchi, F., Eliassi-Rad, T., Getoor, L., Gummadi, K.P., Stoyanovich, J.: The responsibility challenge for data. In: SIGMOD, pp. 412\u2013414 (2019)","DOI":"10.1145\/3299869.3314327"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.4086\/toc.2015.v011a004","volume":"11","author":"D Kempe","year":"2015","unstructured":"Kempe, D., Kleinberg, J.M., Tardos, \u00c9.: Maximizing the spread of influence through a social network. Theory Comput. 11, 105\u2013147 (2015)","journal-title":"Theory Comput."},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Khajehnejad, A., Khajehnejad, M., Babaei, M., Gummadi, K.P., Weller, A., Mirzasoleiman, B.: Crosswalk: fairness-enhanced node representation learning. In: AAAI, pp. 11963\u201311970 (2022)","DOI":"10.1609\/aaai.v36i11.21454"},{"issue":"93","key":"22_CR18","first-page":"2761","volume":"9","author":"A Krause","year":"2008","unstructured":"Krause, A., McMahan, H.B., Guestrin, C., Gupta, A.: Robust submodular observation selection. J. Mach. Learn. Res. 9(93), 2761\u20132801 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1080\/15427951.2009.10129177","volume":"6","author":"J Leskovec","year":"2009","unstructured":"Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks. Internet Math. 6(1), 29\u2013123 (2009)","journal-title":"Internet Math."},{"issue":"10","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li, Y., Fan, J., Wang, Y., Tan, K.: Influence maximization on social graphs: a survey. IEEE Trans. Knowl. Data Eng. 30(10), 1852\u20131872 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M.T., Dinh, T.N.: Stop-and-stare: optimal sampling algorithms for viral marketing in billion-scale networks. In: SIGMOD, pp. 695\u2013710 (2016)","DOI":"10.1145\/2882903.2915207"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Rahmattalabi, A., et al.: Fair influence maximization: a welfare optimization approach. In: AAAI, pp. 11630\u201311638 (2021)","DOI":"10.1609\/aaai.v35i13.17383"},{"key":"22_CR23","unstructured":"Rahmattalabi, A., et al.: Exploring algorithmic fairness in robust graph covering problems. In: NeurIPS, pp. 15750\u201315761 (2019)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Roeschley, A., Buchanan, S.A., Burke, M., Graf, A., Zavalina, O.L.: Considering individual and community contexts within information pedagogy, scholarship, and practice. In: ASIST. Proc. Assoc. Inf. Sci. Technol., vol.\u00a057 (2020)","DOI":"10.1002\/pra2.283"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: SIGMOD, pp. 1539\u20131554 (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: SIGMOD, pp. 75\u201386 (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Tsang, A., Wilder, B., Rice, E., Tambe, M., Zick, Y.: Group-fairness in influence maximization. In: IJCAI, pp. 5997\u20136005 (2019)","DOI":"10.24963\/ijcai.2019\/831"},{"key":"22_CR28","unstructured":"Udwani, R.: Multi-objective maximization of monotone submodular functions with cardinality constraint. In: NeurIPS, pp. 9513\u20139524 (2018)"},{"key":"22_CR29","unstructured":"Wang, Y., Li, Y., Bonchi, F., Wang, Y.: Balancing utility and fairness in submodular maximization. In: EDBT, pp. 1\u201314 (2024)"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7238-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T16:15:54Z","timestamp":1724775354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7238-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819772377","9789819772384"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7238-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jinhua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2024.zjnu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}