Related papers: On the Hierarchy of Distributed Majority Protocols
Population protocols are a model for distributed computing that is focused on simplicity and robustness. A system of $n$ identical agents (finite state machines) performs a global task like electing a unique leader or determining the…
The problem of analyzing the performance of networked agents exchanging evidence in a dynamic network has recently grown in importance. This problem has relevance in signal and data fusion network applications and in studying opinion and…
Consensus protocols play an important role in the study of distributed algorithms. In this paper, we study the effect of bias on two popular consensus protocols, namely, the {\em voter rule} and the {\em 2-choices rule} with binary…
We study opinion evolution in networks of stubborn agents discussing a sequence of issues, modeled through the so called concatenated Friedkin-Johnsen (FJ) model. It is concatenated in the sense that agents' opinions evolve for each issue,…
This paper considers the consensus problem of a novel opinion dynamics model with group pressure and self-confidence. Different with the most existing paper, the influence of friends of friends in a social network is taken into account,…
We consider an opinion dynamics model where, during random pair interactions, each agent modifies her opinions about both agents of the random pair and also about some other agents, chosen randomly. Moreover, each agent belongs to a single…
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…
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…
The voter model is an archetypal stochastic process that represents opinion dynamics. In each update, one agent is chosen uniformly at random. The selected agent then copies the current opinion of a randomly selected neighbour. We…
Models of consensus are used to manage multiple agent systems in order to choose between different recommendations provided by the system. It is assumed that there is a central agent that solicits recommendations or plans from other agents.…
Motivated by the large expansion in the study of social networks, this paper deals with the problem of multiple messages spreading over the same network using gossip algorithms. Given two messages distributed over some nodes of the graph,…
A continuous-opinion model accounting for the social compromise propensity is theoretically and numerically analysed. An agent's opinion is represented by a real number that can be changed through social interactions with her neighbours.…
We study a model of a population making a binary decision based on information spreading within the population, which is fully connected or covering a square grid. We assume that a fraction of the population wants to make the choice of the…
In this paper we address the consensus problem in the context of networked agents whose communication graph can be split into a certain number of clusters in such a way that interactions between agents in the same clusters are cooperative,…
We consider the problem of multi-choice majority voting in a network of $n$ agents where each agent initially selects a choice from a set of $K$ possible choices. The agents try to infer the choice in majority merely by performing local…
We study the role of hierarchical structures in a simple model of collective consensus formation based on the bounded confidence model with continuous individual opinions. For the particular variation of this model considered in this paper,…
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…
This paper investigates the consensus problem in almost sure sense for uncertain multi-agent systems with noises and fixed topology. By combining the tools of stochastic analysis, algebraic graph theory, and matrix theory, we analyze the…
In this chapter we look at one of the canonical driving examples for multi-agent systems: average consensus. In this scenario, a group of agents seek to agree on the average of their initial states. Depending on the particular application,…
Understanding how opinions spread through a community or how consensus emerges in noisy environments can have a significant impact on our comprehension of social relations among individuals. In this work a model for the dynamics of opinion…