About the Power to Enforce and Prevent Consensus by Manipulating Communication Rules
Jan Lorenz, Diemo Urbig

TL;DR
This paper investigates how communication rules can be manipulated to enforce or prevent consensus in continuous opinion dynamics, revealing that consensus can be achieved with smaller confidence bounds and identifying strategies that influence consensus likelihood.
Contribution
It provides mathematical analysis showing reduced confidence bounds can still lead to consensus and proves limits on preventing consensus, introducing strategic agent behaviors affecting outcomes.
Findings
Consensus achievable with smaller confidence bounds than in random encounter models
Prevention of consensus impossible for confidence bounds greater than 0.5 in large groups
Balancing agents promote consensus, especially when cautious; curious agents' effect depends on their caution level
Abstract
We explore the possibilities of enforcing and preventing consensus in continuous opinion dynamics that result from modifications in the communication rules. We refer to the model of Weisbuch and Deffuant, where agents adjust their continuous opinions as a result of random pairwise encounters whenever their opinions differ not more than a given bound of confidence . A high leads to consensus, while a lower leads to a fragmentation into several opinion clusters. We drop the random encounter assumption and ask: How small may be such that consensus is still possible with a certain communication plan for the entire group? Mathematical analysis shows that may be significantly smaller than in the random pairwise case. On the other hand we ask: How large may be such that preventing consensus is still possible? In answering this question we prove…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
