Skip to content
Open access

Balancing fairness and influence spread in social networks: a multi-objective evolutionary approach

Jul 2026 · Artificial Intelligence Review · 0 citations

TL;DR

A group-aware multi-objective evolutionary framework that decomposes seed sets into group-specific sub-solutions that maintains population diversity through subpopulation co-evolution and adaptive sampling and introduces a sampling-based strategy that generates new composite solutions by probabilistically selecting best, worst, or random sub-solutions from each group.

Abstract

Influence maximization in social networks has received increasing attention, particularly in applications where fairness among demographic groups is an important concern. However, many existing approaches either overlook group-level disparities or primarily optimize influence spread without explicitly modeling fairness-related trade-offs. In this paper, we propose a group-aware multi-objective evolutionary framework that decomposes seed sets into group-specific sub-solutions. Each demographic group maintains independent subpopulations, which are evolved to improve local influence within the corresponding group. The optimized sub-solutions are then recombined into full solutions, which are globally evaluated using two objectives: total influence spread and inter-group fairness, estimated via pre-generated Reverse Reachable sets. This design reduces the need for repeated diffusion simulations during optimization and can improve computational efficiency. To further enhance diversity and reduce the risk of premature convergence, we introduce a sampling-based strategy that generates new composite solutions by probabilistically selecting best, worst, or random sub-solutions from each group. Multi-objective selection is performed using Pareto dominance, front ranking, an elite archive, and crowding distance. The proposed framework maintains population diversity through subpopulation co-evolution and adaptive sampling. Experimental evaluations conducted on eleven synthetic networks and five real-world datasets show that the proposed method achieves competitive or improved performance relative to strong baselines, considering both fairness of coverage across groups and overall influence propagation.

Read PDF

Similar papers

Conference Jul 2026

Fair Influence Maximization with Reverse Influence Sampling Boosted Multi-Objective Genetic Algorithm

Influence maximization (IM) selects a small set of seed users to maximize expected diffusion in a social network, typically under the Independent Cascade model. Optimizing only global spread can amplify pre-existing structural inequities: some groups (e.g., demographics, communities, or departments) may receive far les...

Akash Janardhan Srinivas, Petros Potikas, William B. Andreopoulos et al. · 0 citations

Discount Allocation for Benefit Maximization in Social Networks

This paper studies the benefit related to interactions among activated nodes and proposes a new problem named discount allocation for benefit maximization, where a few selected users are offered with discounts and hope that they promote this influence to their friends so as to maximize the benefit between all influence...

Chuan-Gen Gao, Shu-Yang Gu, Gui-juan Wang · 0 citations

Mutually Reinforced Fair Multi-View Clustering

The proposed MR-FMVC optimizes fairness alignment and clustering iteratively to enable coordinated optimization and achieves a superior trade-off be-tween clustering performance and fairness.

Jia-Xin Wang, Xiaoxu Tan, Jie-Ren Cheng et al. · 0 citations
Book Open access Aug 2026

Approximation and Learning-based Algorithms for Influence Maximization in Multilayer Social Networks

A hybrid propagation model that jointly captures layer-specific diffusion dynamics and probabilistic cross-layer propagation is introduced that formally defines the Mlim problem and establishes its NP-hardness, monotonicity, and submodularity.

Xueqin Chang, Rui-Ze Liu, Qing Liu et al. · 0 citations
Review Aug 2026

Fairness-Aware Network Embeddings: Methods, Applications, and Challenges

This survey presents a comprehensive overview of fairness-aware network embeddings for complex networks and proposes a taxonomy that categorizes existing methods along three main complementary dimensions: underlying embedding approach, fairness intervention strategy, and fairness objective criterion.

E. Has, Harshit Yadav, Gaurav Dixit et al. · 1 citation
Open access Sep 2026

A Reinforcement Learning-Driven Multi-Agent Cooperative Grey Wolf Algorithm for Influence Maximization

Experiments on six real-world social networks under the Independent Cascade model show that Multiple-roles GWO achieves competitive or superior influence spread compared with state-of-the-art heuristic baselines, with comparable computational efficiency.

Yu-Kai Yao, Cheng-Long Zhang, Qi-Rui Guo et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.