Related papers: Finite-time consensus in a compromise process
Is there an equilibrium for distributed consensus when all agents except one collude to steer the decision value towards their preference? If an equilibrium exists, then an $n-1$ size coalition cannot do better by deviating from the…
We introduce a model of negotiation dynamics whose aim is that of mimicking the mechanisms leading to opinion and convention formation in a population of individuals. The negotiation process, as opposed to ``herding-like'' or ``bounded…
We study an opinion dynamics model that explores the competition between persuasion and compromise in a population of agents with nearest-neighbor interactions on a two-dimensional square lattice. Each agent can hold either a positive or a…
We study the Consensus problem among $n$ agents, defined as follows. Initially, each agent holds one of two possible opinions. The goal is to reach a consensus configuration in which every agent shares the same opinion. To this end, agents…
We study a model for social influence in which the agents' opinion is a continuous variable [G. Weisbuch et al., Complexity \textbf{7}, 2, 55 (2002)]. The convergent opinion adjustment process takes place as a result of random binary…
The original Hegselmann-Krause (HK) model comprises a set of $n$ agents characterized by their opinion, a number in $[0,1]$. Agent $i$ updates its opinion $x_i$ via taking the average opinion of its neighbors whose opinion differs by at…
We here discuss a model of continuous opinion dynamics in which agents adjust continuous opinions as a result of random binary encounters whenever their difference in opinion is below a given threshold. We concentrate on the version of the…
We investigate majority rule dynamics in a population with two classes of people, each with two opinion states $\pm 1$, and with tunable interactions between people in different classes. In an update, a randomly selected group adopts the…
A model for continuous-opinion dynamics is proposed and studied by taking advantage of its similarities with a mono-dimensional granular gas. Agents interact as in the Deffuant model, with a parameter $\alpha$ controlling the persuasibility…
A novel way of characterizing the process of reaching consensus for a social system is given. The foundation of the characterization is based on the theorem which states that the sufficient and necessary condition for a system to reach the…
In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems - \emph{binary majority consensus}, in the presence of probabilistic message loss. Using…
Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try to achieve agreements on…
We investigate opinion formation in a kinetic exchange opinion model, where opinions are represented by numbers in the real interval $[-1,1]$ and agents are typified by the individual degree of conviction about the opinion that they…
The voter model is a simple agent-based model to mimic opinion dynamics in social networks: a randomly chosen agent adopts the opinion of a randomly chosen neighbour. This process is repeated until a consensus emerges. Although the basic…
We present a model that explores the influence of persuasion in a population of agents with positive and negative opinion orientations. The opinion of each agent is represented by an integer number $k$ that expresses its level of agreement…
We propose an opinion model based on agents located at the vertices of a regular lattice. Each agent has an independent opinion (among an arbitrary, but fixed, number of choices) and its own degree of conviction. The latter changes every…
A seminal result by Lamport shows that at least $\max\{2e+f+1,2f+1\}$ processes are required to implement partially synchronous consensus that tolerates $f$ process failures and can furthermore decide in two message delays under $e$…
We study consensus processes on the complete graph of $n$ nodes. Initially, each node supports one from up to n opinions. Nodes randomly and in parallel sample the opinions of constant many nodes. Based on these samples, they use an update…
We consider the \emph{exact plurality consensus} problem for \emph{population protocols}. Here, $n$ anonymous agents start each with one of $k$ opinions. Their goal is to agree on the initially most frequent opinion (the \emph{plurality…
The present work analyses a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple messages,…