Equivalent bounded confidence processes
Sascha Kurz

TL;DR
This paper analyzes the bounded confidence opinion dynamics model, showing that for any initial configuration, the process can be classified into finitely many equivalence classes, enabling systematic study of phenomena like stabilization time and opinion fragmentation.
Contribution
It introduces a systematic classification of bounded confidence processes into finitely many equivalence classes, independent of initial opinions, facilitating comprehensive analysis of opinion dynamics.
Findings
Finite classification of opinion evolution processes
Algorithm for computing equivalence classes
Insights into stabilization time and fragmentation
Abstract
In the bounded confidence model the opinions of a set of agents evolve over discrete time steps. In each round an agent averages the opinion of all agents whose opinions are at most a certain threshold apart. Here we assume that the opinions of the agents are elements of the real line. The details of the dynamics are determined by the initial opinions of the agents, i.e. a starting configuration, and the mentioned threshold -- both allowing uncountable infinite possibilities. Recently it was observed that for each starting configuration the set of thresholds can be partitioned into a finite number of intervals such that the evolution of opinions does not depend on the precise value of the threshold within one of the intervals. So, we may say that, given a starting configuration of initial opinions, there is only a finite number of equivalence classes of bounded confidence processes (and…
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.
Taxonomy
TopicsOpinion Dynamics and Social Influence · Game Theory and Applications · Theoretical and Computational Physics
