Skip to content
Conference

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

Jul 2026 · International Conference on Big Data Computing Service and Applications · pp. 138-145 · 0 citations · 28 references

Abstract

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 less exposure than others even when the overall spread is high. We present FIMMOGA++, a fairness-aware influence maximization framework that formulates IM as a multi-objective optimization problem over expected spread and multiple groupfairness objectives. FIMMOGA++ integrates efficient influence estimation via Reverse Influence Sampling (RIS) with a manyobjective genetic algorithm. Our framework returns a Pareto front of seed sets, explicitly exposing the trade-off between diffusion efficiency and fairness. We show that FIMMOGA++ improves fairness metrics (e.g., Max–Min group coverage and inequality) while remaining competitive in terms of spread and runtime relative to standard IM baselines.

View source

Similar papers

Book Open access Aug 2026

One Rounding Fits All: Memory-Efficient Approximation Algorithms for Partition-Constrained Influence Maximization

RBwA, a memory-efficient and sample-efficient progressive sampling algorithm for IM-PC and a memory-efficient rounding scheme called BwARound for coverage maximization subroutines, which only requires storing one fractional vector and takes maximal feasible steps rather than tiny ε-increments, are proposed.

Qixin Zhang, Qirun Zeng, Hui Lu et al. · 0 citations
Open access Aug 2026

Temporal multi-path marginal coverage for finite-horizon influence maximization

Influence maximization seeks a limited seed set that maximizes diffusion spread. Topology-based rankings are efficient but often ignore finite-horizon dynamics and seed-set redundancy, whereas simulation-assisted greedy methods can be computationally expensive. To balance effectiveness, efficiency, and interpretability...

Tian-Fu Zhang, Bao-Jun Fu · 0 citations
Preprint Sep 2026

Budget-Independent Influence Maximization in Nearly Linear Time

This work reserves $O(\varepsilon k)$ seed positions for cost-weighted random vertices, allowing reverse-reachable searches to stop as soon as they encounter a reserved seed.

Zhi-Jie Zhang · 1 citation

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
Open access 2026

Latent Preference Inference and Bilevel Fairness Optimization for Hybrid Expert-Crowd Ranking Systems

A probabilistic inverse framework for latent preference recovery and a bilevel scheme for fairness-aware ranking optimization are presented, which reaches a 99.71 percent elimination-prediction hit rate under steady-state noise and improves fairness by about 40 percent.

Zhen-Heng Fu · 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

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