Related papers: DejaVu: A Minimalistic Mechanism for Distributed P…
We propose decentralized primal-dual methods for cooperative multi-agent consensus optimization problems over both static and time-varying communication networks, where only local communications are allowed. The objective is to minimize the…
During the last decades, quite a number of interacting particle systems have been introduced and studied in the border area of mathematics and statistical physics. Some of these can be seen as simplistic models for opinion formation…
How to efficiently and reliably spread information in a system is one of the most fundamental problems in distributed computing. Recently, inspired by biological scenarios, several works focused on identifying the minimal communication…
Information Elicitation Without Verification (IEWV) refers to the problem of eliciting high-accuracy solutions from crowd members when the ground truth is unverifiable. A high-accuracy team solution (aggregated from members' solutions)…
We introduce two models of consensus following a majority rule on time-evolving stochastic block models (SBM), in which the network evolution is Markovian or non-Markovian. Under the majority rule, in each round, each agent simultaneously…
A generalized family of Adversary Robust Consensus protocols is proposed and analyzed. These are distributed algorithms for multi-agents systems seeking to agree on a common value of a shared variable, even in the presence of faulty or…
Achieving consensus via nearest neighbor rules is an important prerequisite for multi-agent networks to accomplish collective tasks. A common assumption in consensus setup is that each agent interacts with all its neighbors. This paper…
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…
We introduce the incremental voter model (IVM), a discrete-opinion multi-agent system where agents undergo step-wise transitions biased by the opinion of a randomly selected persuader. Our incremental voter model comprises a large…
Average consensus (AC) strategies play a key role in every system that employs cooperation by means of distributed computations. To promote consensus, an $N$-agent network can repeatedly combine certain node estimates until their mean value…
We study a setting where a group of agents, each receiving partially informative private signals, seek to collaboratively learn the true underlying state of the world (from a finite set of hypotheses) that generates their joint observation…
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…
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 paper, we study a distributed parameter estimation problem with an asynchronous communication protocol over multi-agent systems. Different from traditional time-driven communication schemes, in this work, data can be transmitted…
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…
In the Sznajd model of 2000, a pair of neighbouring agents on a square lattice convinces its six neighbours of the pair opinion iff the two agents of the pair share the same opinion. Now we replace the usual random sequential updating rule…
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 study the problem of resilient consensus of sampled-data multi-agent networks with double-integrator dynamics. The term resilient points to algorithms considering the presence of attacks by faulty/malicious agents in the network. Each…
A protocol for distributed estimation of discrete distributions is proposed. Each agent begins with a single sample from the distribution, and the goal is to learn the empirical distribution of the samples. The protocol is based on a simple…
In this manuscript, we introduce and study a variant of the agent-based opinion dynamics proposed in a recent work [8], within the framework of an interacting multi-agent system, where agents are assumed to interact with each other and…