{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T18:44:40Z","timestamp":1785177880388,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071478"],"award-info":[{"award-number":["12071478"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10115-024-02314-0","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T04:18:22Z","timestamp":1736741902000},"page":"3487-3511","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fairness-constrained multigroup influence maximization"],"prefix":"10.1007","volume":"67","author":[{"given":"Zizhen","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yongcai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenping","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"2314_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"2314_CR2","doi-asserted-by":"crossref","unstructured":"Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"2314_CR3","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"issue":"10","key":"2314_CR4","doi-asserted-by":"crossref","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-L (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2314_CR5","doi-asserted-by":"crossref","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","volume":"62","author":"S Banerjee","year":"2020","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowl Inf Syst 62:3417\u20133455","journal-title":"Knowl Inf Syst"},{"key":"2314_CR6","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s10115-012-0540-7","volume":"33","author":"Y-C Chen","year":"2012","unstructured":"Chen Y-C, Peng W-C, Lee S-Y (2012) Efficient algorithms for influence maximization in social networks. Knowl Inf Syst 33:577\u2013601","journal-title":"Knowl Inf Syst"},{"key":"2314_CR7","unstructured":"Rahmattalabi A, Vayanos P, Fulginiti A, Rice E, Wilder B, Yadav A, Tambe M (2019) Exploring algorithmic fairness in robust graph covering problems. Adv Neural Inf Process Syst 32"},{"key":"2314_CR8","doi-asserted-by":"crossref","unstructured":"Khajehnejad M, Rezaei AA, Babaei M, Hoffmann J, Jalili M, Weller A (2020) Adversarial graph embeddings for fair influence maximization over social networks. arXiv preprint arXiv:2005.04074","DOI":"10.24963\/ijcai.2020\/594"},{"key":"2314_CR9","doi-asserted-by":"crossref","unstructured":"Adesokan A, Siraj MS, Rahman AB, Tsiropoulou EE, Papavassiliou S (2023) How to become an influencer in social networks. In: ICC 2023-IEEE international conference on communications. IEEE, pp 5570\u20135575","DOI":"10.1109\/ICC45041.2023.10279644"},{"key":"2314_CR10","doi-asserted-by":"crossref","unstructured":"Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, pp 61\u201370","DOI":"10.1145\/775047.775057"},{"key":"2314_CR11","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2019.112905","volume":"140","author":"MM Keikha","year":"2020","unstructured":"Keikha MM, Rahgozar M, Asadpour M, Abdollahi MF (2020) Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Syst Appl 140:112905","journal-title":"Expert Syst Appl"},{"key":"2314_CR12","doi-asserted-by":"crossref","unstructured":"Rawls J (1971) Atheory of justice. Cambridge (Mass.)","DOI":"10.4159\/9780674042605"},{"key":"2314_CR13","doi-asserted-by":"crossref","unstructured":"Tsang A, Wilder B, Rice E, Tambe M, Zick Y (2019) Group-fairness in influence maximization. arXiv preprint arXiv:1903.00967","DOI":"10.24963\/ijcai.2019\/831"},{"key":"2314_CR14","doi-asserted-by":"crossref","unstructured":"Fish B, Bashardoust A, Boyd D, Friedler S, Scheidegger C, Venkatasubramanian S (2019) Gaps in information access in social networks? In: The world wide web conference, pp 480\u2013490","DOI":"10.1145\/3308558.3313680"},{"key":"2314_CR15","doi-asserted-by":"crossref","unstructured":"Gershtein S, Milo T, Youngmann B, Zeevi G (2018) Im balanced: influence maximization under balance constraints. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 1919\u20131922","DOI":"10.1145\/3269206.3269212"},{"issue":"12","key":"2314_CR16","doi-asserted-by":"crossref","first-page":"2421","DOI":"10.1109\/TKDE.2018.2820010","volume":"30","author":"A Cali\u00f2","year":"2018","unstructured":"Cali\u00f2 A, Interdonato R, Pulice C, Tagarelli A (2018) Topology-driven diversity for targeted influence maximization with application to user engagement in social networks. IEEE Trans Knowl Data Eng 30(12):2421\u20132434","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2314_CR17","doi-asserted-by":"crossref","unstructured":"Lin S-C, Lin S-D, Chen M-S (2015) A learning-based framework to handle multi-round multi-party influence maximization on social networks. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, pp 695\u2013704","DOI":"10.1145\/2783258.2783392"},{"key":"2314_CR18","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. Adv Neural Inf Process Syst 30"},{"key":"2314_CR19","unstructured":"Li H, Xu M, Bhowmick SS, Sun C, Jiang Z, Cui J (2019) Disco: influence maximization meets network embedding and deep learning. arXiv preprint arXiv:1906.07378"},{"key":"2314_CR20","doi-asserted-by":"crossref","unstructured":"Li H, Xu M, Bhowmick SS, Rayhan JS, Sun C, Cui J (2022) Piano: influence maximization meets deep reinforcement learning. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2022.3164667"},{"key":"2314_CR21","doi-asserted-by":"crossref","unstructured":"Wang C, Liu Y, Gao X, Chen G (2021) A reinforcement learning model for influence maximization in social networks. In: Database systems for advanced applications: 26th international conference, DASFAA 2021, Taipei, Taiwan, April 11\u201314, 2021, Proceedings, Part II. Springer, pp 701\u2013709","DOI":"10.1007\/978-3-030-73197-7_48"},{"issue":"20","key":"2314_CR22","first-page":"10","volume":"1050","author":"P Velickovic","year":"2017","unstructured":"Velickovic P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y et al (2017) Graph attention networks. Stat 1050(20):10\u201348550","journal-title":"Stat"},{"key":"2314_CR23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1613\/jair.3987","volume":"48","author":"DM Roijers","year":"2013","unstructured":"Roijers DM, Vamplew P, Whiteson S, Dazeley R (2013) A survey of multi-objective sequential decision-making. J Artif Intell Res 48:67\u2013113","journal-title":"J Artif Intell Res"},{"key":"2314_CR24","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/BF02591870","volume":"26","author":"RE Steuer","year":"1983","unstructured":"Steuer RE, Choo E-U (1983) An interactive weighted Tchebycheff procedure for multiple objective programming. Math Program 26:326\u2013344","journal-title":"Math Program"},{"issue":"1","key":"2314_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/21.87068","volume":"18","author":"RR Yager","year":"1988","unstructured":"Yager RR (1988) On ordered weighted averaging aggregation operators in multicriteria decision making. IEEE Trans Syst Man Cybern 18(1):183\u2013190","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"2314_CR26","first-page":"190","volume":"6992","author":"W Ogryczak","year":"2011","unstructured":"Ogryczak W, Perny P, Weng P (2011) On minimizing ordered weighted regrets in multiobjective Markov decision processes. ADT 6992:190\u2013204","journal-title":"ADT"},{"issue":"05","key":"2314_CR27","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1142\/S0219622013400075","volume":"12","author":"W Ogryczak","year":"2013","unstructured":"Ogryczak W, Perny P, Weng P (2013) A compromise programming approach to multiobjective Markov decision processes. Int J Inf Technol Decis Mak 12(05):1021\u20131053","journal-title":"Int J Inf Technol Decis Mak"},{"key":"2314_CR28","volume-title":"Fair Division and Collective Welfare","author":"H Moulin","year":"2004","unstructured":"Moulin H (2004) Fair Division and Collective Welfare. MIT Press, Cambridge"},{"issue":"4","key":"2314_CR29","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0165-4896(81)90018-4","volume":"1","author":"JA Weymark","year":"1981","unstructured":"Weymark JA (1981) Generalized Gini inequality indices. Math Soc Sci 1(4):409\u2013430","journal-title":"Math Soc Sci"},{"key":"2314_CR30","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inf Process Syst 28"},{"key":"2314_CR31","doi-asserted-by":"crossref","unstructured":"Wu L, Sun P, Fu Y, Hong R, Wang X, Wang M (2019) A neural influence diffusion model for social recommendation. In: Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval, pp 235\u2013244","DOI":"10.1145\/3331184.3331214"},{"key":"2314_CR32","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826"},{"key":"2314_CR33","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. Adv Neural Inf Process Syst 30"},{"key":"2314_CR34","doi-asserted-by":"crossref","unstructured":"Yadav A, Wilder B, Rice E, Petering R, Craddock J, Yoshioka-Maxwell A, Hemler M, Onasch-Vera L, Tambe M, Woo D (2018) Bridging the gap between theory and practice in influence maximization: raising awareness about HIV among homeless youth. In: IJCAI, pp 5399\u20135403","DOI":"10.24963\/ijcai.2018\/761"},{"key":"2314_CR35","unstructured":"Wilder B, Ou H-C, Haye K, Tambe M (2018) Optimizing network structure for preventative health. In: AAMAS, pp 841\u2013849"},{"issue":"16","key":"2314_CR36","doi-asserted-by":"crossref","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Phys. A 391(16):4165\u20134180","journal-title":"Phys. A"},{"key":"2314_CR37","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1613\/jair.1.14450","volume":"76","author":"M Lin","year":"2023","unstructured":"Lin M, Sun L, Yang R, Liu X, Wang Y, Li D, Li W, Lu S (2023) Fair influence maximization in large-scale social networks based on attribute-aware reverse influence sampling. J Artif Intell Res 76:925\u2013957","journal-title":"J Artif Intell Res"},{"key":"2314_CR38","unstructured":"Hardt M, Price E, Srebro N (2016) Equality of opportunity in supervised learning. Adv Neural Inf Process Syst 29"},{"key":"2314_CR39","doi-asserted-by":"crossref","unstructured":"Stoica A-A, Han JX, Chaintreau A (2020) Seeding network influence in biased networks and the benefits of diversity. In: Proceedings of the web conference 2020, pp 2089\u20132098","DOI":"10.1145\/3366423.3380275"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02314-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02314-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02314-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T05:24:13Z","timestamp":1744003453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02314-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,13]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2314"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02314-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,13]]},"assertion":[{"value":"4 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or nonfinancial interest in the subject matter or materials discussed in this manuscript. The datasets generated during and\/or analyzed during the current study are available from the corresponding author on reasonable request.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}