SearcharxivSearch

arXiv · 2609.22524

Strategic Opinion Manipulation in Multiplex Networks

Abstract

Models of opinion dynamics on networks, provide a framework to study how a network of agents aggregates dispersed opinions into a consensus. However, existing models assume that agents truthfully report their opinions, and do not account for environments in which a platform aggregates agents' reports across multiple networks, and agents can strategically report different opinions on each. In this paper, we propose a model of strategic opinion manipulation on multiplex networks, in which a platform merges L network layers with attention weights, and each agent, holding a private opinion, chooses (potentially different) reports on each layer, at a layer-specific misreporting cost, so as to pull the merged consensus toward their own opinion. We show that this game has a unique Nash equilibrium in closed form, that the resulting consensus is the truthful consensus under a centrality tilted toward a manipulability index of each agent, and that the resulting distortion is the (centrality-weighted) covariance of agents' manipulability and opinions. We further show that agents' reports on every layer are more extreme than their opinions, so that the polarization observed by the platform overestimates the true polarization. Notably, we highlight that merging layers is a double-edged sword: as manipulability depends on the square of an agent's influence on each layer, spreading attention across layers dilutes manipulation, while heterogeneous misreporting costs across layers and shifts in agents' centralities can amplify it. Finally, we characterize the platform's optimal choice of attention weights, in closed form when the layers share a stationary distribution, and through an exact gradient and a marginal test otherwise. Together, our findings shed light on when aggregating opinions across networks is (not) robust to strategic manipulation, and point out potential interventions to alleviate it.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raman Ebrahimi, Massimo Franceschetti. 2026-09-18. Strategic Opinion Manipulation in Multiplex Networks. https://arxiv.org/abs/2609.22524

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Learning in Structured Stackelberg Games

We initiate the study of structured Stackelberg games, a novel form of strategic interaction between a leader and a follower where contextual information can be predictive of the follower's (unknown) type. Motivated by applications such as security games and AI safety, we show how this additional structure can help the leader learn a utility-maximizing policy in both the online and distributional settings. In the online setting, we first prove that standard learning-theoretic measures of complexity do not characterize the difficulty of the leader's learning task. Notably, we find that there exists a learning-theoretic measure of complexity, analogous to the Littlestone dimension in online classification, that tightly characterizes the leader's instance-optimal regret. We term this the Stackelberg-Littlestone dimension, and leverage it to provide a provably optimal online learning algorithm. In the distributional setting, we provide analogous results by showing that two new dimensions control the sample complexity upper- and lower-bound.

cs.GT

Equilibrium and Infeasibility: A new solution concept for games

Addressing infeasibility in non-cooperative games has become an important topic, as many problems across different applications face this issue. In this paper, we propose a new solution concept for generalized games with possibly infeasible individual constraints. A solution is defined as the limit of a sequence of generalized Nash equilibria induced by games with penalty terms relaxing the individual constraints. Existence is established for a broad range of games and we provide conditions allowing to characterize a $ψ$-penalized solution as a strategy profile maximizing every player's utility over all her penalty minimizing strategies. A variation of Divide-the-Dollar serves as an illustrative example. We further establish the compatibility with the GNE and the solution to the Nash bargaining.

cs.GT

Subgame-Perfect Nash Equilibria of Plurality Voting with Abstention: a PSPACE-Completeness Result for Restricted Ballots

We consider sequential Plurality elections in which each voter may abstain or vote for a single candidate. Each voter assigns utilities to all candidates; for each voter, this induces a (weak) order over the candidates. Ties are resolved uniformly at random, and voting has a small positive cost, so that a voter prefers to abstain when their vote cannot change the election outcome. We consider a variant of this model where, for each voter, we additionally specify a prefix of her ranking, so that she is only allowed to vote for a candidate from that prefix (or abstain). We prove that for this variant of the model, deciding whether a designated candidate is among the election winners in a subgame-perfect equilibrium of the associated extensive-form game is PSPACE-complete. This partially resolves an open problem from the work of Desmedt and Elkind [2010].

cs.GT