Equivalent bounded confidence processes

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 an algorithm to compute them). Here we systematically study different notions of equivalence. In our widest notion we can also get rid of the initial starting configuration and end up with a finite number of equivalent bounded confidence processes for each given (finite) number of agents. This allows to precisely study the occurring phenomena for small numbers of agents without the jeopardy of missing interesting cases by performing numerical experiments. We exemplarily study the freezing time, i.e. number of time steps needed until the process stabilizes, and the degree of fragmentation, i.e. the number of different opinions that survive once the process has reached its final state.

💡 Research Summary

The paper investigates the Hegselmann‑Krause (HK) bounded‑confidence (BC) model, where n agents hold real‑valued opinions and, at each discrete time step, simultaneously update their opinion to the average of all agents whose opinions lie within a confidence radius ε. The authors focus on the combinatorial structure underlying this dynamical system and introduce several notions of equivalence that dramatically reduce the infinite parameter space (initial opinions and ε) to a finite set of representative processes.

First, the authors formalize the influence graph G(t) at time t: vertices correspond to agents, and an undirected edge {i,j} exists iff |x_i(t)‑x_j(t)| ≤ ε. Because the update rule depends only on the set of insiders I_i(t), which can be read directly from G(t), the entire evolution of a BC process can be described by a finite sequence of influence graphs. This observation leads to the definition of several equivalence relations:

1. Affine equivalence – scaling and translation of all opinions together with a proportional scaling of ε (P′ = αP + β). Under this relation any process can be normalized to opinions in