Skip to content
Preprint

Strategic Opinion Manipulation in Multiplex Networks

Sep 2026 · 0 citations · 35 references
Computer Science

TL;DR

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.

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.

View source

Similar papers

Preprint Sep 2026

Agent-based Modeling: Equilibrium, Echo Chambers, and Efficiency in Hybrid Coevolutionary Opinion Games

The Hybrid Coevolutionary Opinion Game (H-COG) is introduced, in which analytical and LLM-driven agents share one network, choose their neighbors by opinion similarity in every round, and hold stances drawn from real Reddit comments on gun control and abortion.

Ming-Zhi Jiang, An-Tzu Teng, Jun-En Liu et al. · 0 citations
#machine learning Preprint Sep 2026

Bias Amplification in Multi-Agent Network: How Biased Agents Shape Opinions and Rhetoric

Large language models (LLMs) are increasingly deployed in applications involving interaction between agents, where their output plays a role in collective reasoning and decision-making processes. Despite significant research into the functioning of LLMs in such multi-agent systems, the processes of bias propagation in...

Omran Berjawi, G. Fenza, Rida Khatoun · 0 citations
Preprint Oct 2026

Network Intervention by Polling Strategic Agents

A planner in a network of strategic agents faces three entangled challenges: the optimum depends on agents'private information, queried agents may misreport to steer the outcome, and exact computation does not scale. We study these challenges in multi-activity network games with heterogeneous private technologies, in w...

Chenyu Zhang, R. Parasnis, Saurabh Amin · 0 citations
2026

Efficient Algorithm for Opinion Optimization via Leader Selection in Directed Social Networks

We study an opinion optimization problem based on an extended DeGroot model for a social network, where stubborn leaders hold fixed opinions of 0 or 1. Given a set of leaders with opinion 0, our goal is to select a small number of leaders with opinion 1 from the remaining nodes to maximize the average opinion of the ne...

Xin-Na Zhou, Zhong-Zhi Zhang · 0 citations
Preprint Oct 2026

Probabilistic neighbors'selection competes with confirmation bias in a bounded confidence model

In this work, we investigate three modified versions of the classic Hegselmann-Krause opinion dynamics model, incorporating features that are typical of many real-world systems, such as uncertainty in the selection of interacting agents and a weighted evaluation of the relevance of their opinions in the influence funct...

Chiara Giaquinta, Laura Hernández, David Chavalarias · 0 citations

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