Related papers: Finite-time consensus in a compromise process
We analyze the convergence of the $k$-opinion Undecided State Dynamics (USD) in the population protocol model. For $k$=2 opinions it is well known that the USD reaches consensus with high probability within $O(n \log n)$ interactions.…
We study binary opinion dynamics in a fully connected network of interacting agents. The agents are assumed to interact according to one of the following rules: (1) Voter rule: An updating agent simply copies the opinion of another randomly…
Problems of consensus in multi-agent systems are often viewed as a series of independent, simultaneous local decisions made between a limited set of options, all aimed at reaching a global agreement. Key challenges in these protocols…
The original Deffuant model consists of a finite number of agents whose opinion is a number in $[0,1]$. Two socially connected agents are uniformly randomly selected at each time step and approach each other at a rate $\mu\in [0,1/2]$ if…
We propose a consensus opinion model based on the evolutionary game. In our model, both of the two connected agents receive a benefit if they have the same opinion, otherwise they both pay a cost. Agents update their opinions by comparing…
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common…
We introduce a simple open-ended model that describes the emergence of a shared vocabulary. The ordering transition toward consensus is generated only by an agreement mechanism. This interaction defines a finite and small number of states,…
We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise…
In the consensus model of Krause-Hegselmann, opinions are real numbers between 0 and 1 and two agents are compatible if the difference of their opinions is smaller than the confidence bound parameter \epsilon. A randomly chosen agent takes…
According to mass media theory, the dissemination of messages and the evolution of opinions in social networks follow a two-step process. First, opinion leaders receive the message from the message sources, and then they transmit their…
Opinion dynamics concerns social processes through which populations or groups of individuals agree or disagree on specific issues. As such, modelling opinion dynamics represents an important research area that has been progressively…
We discuss two models of opinion dynamics. First wepresent a brief review of the Hegselmann and Krause (HK) compromise model in two dimensions, showing that it is possible to simulate the dynamics in the limit of an infinite number of…
In this short note we study what happens in a symmetric opinion model when we send the total interacting population $N(t)$ to infinity as $t \to \infty$. We assume that new population enters the system with opinions that are i.i.d random…
In its simplest form the well known consensus problem for a networked family of autonomous agents is to devise a set of protocols or update rules, one for each agent, which can enable all of the agents to adjust or tune their "agreement…
We consider the problem of finding a compromise between the opinions of a group of individuals on a number of mutually independent, binary topics. In this paper, we quantify the loss in representativeness that results from requiring the…
Opinion formation is an important element of social dynamics. It has been widely studied in the last years with tools from physics, mathematics and computer science. Here, a continuous model of opinion dynamics for multiple possible choices…
We present a new two-state {+-} opinion dynamics model which defines a general frame to include all local dynamics in two-state spin systems. Agents evolve by probabilistic local rules. In each update, groups of various sizes k are formed…
We investigate an opinion model consisting of a large group of interacting agents, whose opinions are represented as numbers in $[-1,1]$. At each update time, two random agents are selected, and the opinion of the first agent is updated…
The \((n,k)\) game models a group of \(n\) individuals with binary opinions, say 1 and 0, where a decision is made if at least \(k\) individuals hold opinion 1. This paper explores the dynamics of the game with heterogeneous agents under…
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for…