The proposed greedy method remains broadly competitive, and on small full-candidate instances it matches the solver-certified mixed-integer linear program (MILP) optimum in five of six tested configurations.
Abstract
Opinion-maximization methods often optimize an aggregate network response and may therefore distribute target-aligned intervention gains unevenly across groups. This issue is especially important in signed networks, where cooperative and antagonistic relations can make the same positive opinion seed increase the equilibrium opinion of one group while decreasing that of another. We study fairness-aware internal-opinion seeding in undirected signed Friedkin–Johnsen networks with heterogeneous anchoring strengths. The objective combines the whole-network average opinion gain with the minimum group-average gain through a tunable fairness parameter. We show that the equilibrium response of any seed set decomposes additively into candidate-wise group-gain vectors. This representation yields an equivalent mixed-integer linear program for exact optimization on tractable instances and an adjoint formulation that evaluates all candidate gains using only one shifted signed-Laplacian solve per group. Because the global averaging vector is a size-weighted combination of the group averaging vectors, no additional global solve is required. We further introduce a dynamically maintained Pareto frontier based on componentwise dominance and establish conditions under which pruning preserves the underlying greedy sequence. Theoretical results establish well-posedness and stability of the signed equilibrium, correctness of the gain and adjoint formulations, sufficient conditions for monotonicity, non-submodularity in general, residual-based numerical error bounds, and computational complexity. Experiments on 14 signed networks ranging from hundreds to more than four million nodes show that the adjoint implementation scales most robustly among the tested methods. The results further demonstrate that the fairness parameter and heterogeneous anchoring strengths can substantially affect both the selected seed sets and the fairness–efficiency balance. Against structural, random, and target-aware Top-K baselines, the proposed greedy method remains broadly competitive, and on small full-candidate instances it matches the solver-certified mixed-integer linear program (MILP) optimum in five of six tested configurations. Overall, the framework provides a scalable approach to group-aware opinion intervention in signed networks while explicitly distinguishing opinion seeding from clamped leader selection.
Opinion control under the Friedkin-Johnsen (FJ) model has traditionally focused on modifying individual users, for example by changing their opinions or susceptibility to social influence. We study a complementary problem: can collective outcomes be steered by modifying the interaction network instead? We formulate str...
Elisabetta Biondi, C. Boldrini, A. Passarella et al.· 0 citations
A detailed look at fairness-aware influence maximization, focusing on important challenges, models, and methods designed to ensure fair influence maximization, and categorizes existing methods into five groups based on their fairness objectives.
S. Singh, S. Meena, Kuldeep Singh et al.· 0 citations
Group fairness in Graph Neural Networks (GNNs) aims to mitigate performance disparities across demographic groups. While existing methods primarily focus on Demographic Parity and Equal Opportunity, Predictive Equality (ΔFPR) remains under-explored, potentially leading to disparate error risks. Furthermore, these metho...
Kai-Xing Liang, Xue-Min Wang, Guo-Feng Xia et al.· Proceedings of the 35th ACM...· 0 citations
Graph-based ranking methods such as PageRank can amplify structural disparities in networks, motivating fairness-aware ranking mechanisms for sensitive groups. Locally Fair PageRank (LFPR) enforces fairness through local propagation, but exact computation requires repeated iterations until convergence, limiting scalabi...
Mukesh Kumar, Gaurav Dixit, A. Saxena· arXiv.org· 0 citations
How individuals respond to their neighbors'opinions shapes whether a networked group reaches consensus. This paper analyzes synchronous discrete-time opinion dynamics on a fixed influence network, where individuals use either weighted-average (WA) or weighted-median (WM) opinion-aggregation mechanisms with individual-s...
Individual fairness in machine learning requires that similar individuals receive similar predictions. Most existing definitions are pairwise in nature, imposing a Lipschitz constraint that must hold either globally across all pairs of data instances or locally within specified neighborhoods. In practice, however, such...
Zhou-Ting Zhao, Tin Lok James Ng· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.