Related papers: On the $h$-majority dynamics with many opinions

The bounded confidence model of opinion dynamics, introduced by Deffuant et al, is a stochastic model for the evolution of continuous-valued opinions within a finite group of peers. We prove that, as time goes to infinity, the opinions…

In several real \emph{Multi-Agent Systems} (MAS), it has been observed that only weaker forms of\emph{metastable consensus} are achieved, in which a large majority of agents agree on some opinion while other opinions continue to be…

We study the problem of reaching agreement in a synchronous distributed system by $n$ autonomous parties, when the communication links from/to faulty parties can omit messages. The faulty parties are selected and controlled by an adaptive,…

We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

Majority-vote model is a much-studied model for social opinion dynamics of two competing opinions. With the recent appreciation that our social network comprises a variety of different layers forming a multiplex network, a natural question…

During recent years the interest of optimization and machine learning communities in high-probability convergence of stochastic optimization methods has been growing. One of the main reasons for this is that high-probability complexity…

Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…

This work extends the recent opinion dynamics model from Cheng et al., emphasizing the role of group pressure in consensus formation. We generalize the findings to incorporate social influence algorithms with general time-varying,…

We study settings in which agents with incomplete preferences need to make a collective decision. We focus on a process of majority dynamics where issues are addressed one at a time and undecided agents follow the opinion of the majority.…

Bounded confidence opinion dynamics model the propagation of information in social networks. However in the existing literature, opinions are only viewed as abstract quantities without semantics rather than as part of a decision-making…

We analyze the asynchronous version of the DeGroot dynamics: In a connected graph $G$ with $n$ nodes, each node has an initial opinion in $[0,1]$ and an independent Poisson clock. When a clock at a node $v$ rings, the opinion at $v$ is…

We introduce a 2-state opinion dynamics model where agents evolve by majority rule. In each update, a group of agents is specified whose members then all adopt the local majority state. In the mean-field limit, where a group consists of…

We consider the stochastic optimization problem with smooth but not necessarily convex objectives in the heavy-tailed noise regime, where the stochastic gradient's noise is assumed to have bounded $p$th moment ($p\in(1,2]$). Zhang et al.…

We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\' en\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two…

The convergence rate is a crucial issue in opinion dynamics, which characterizes how quickly opinions reach a consensus and tells when the collective behavior can be formed. However, the key factors that determine the convergence rate of…

A compromise process describes the evolution of opinions through binary interactions. Opinions are real numbers, and at each step, two randomly selected agents reach a compromise by averaging their pre-interaction opinions. We prove that if…

Let f_{k}(n) be the maximum number of time steps taken to reach equilibrium by a system of n agents obeying the k-dimensional Hegselmann-Krause bounded confidence dynamics. Previously, it was known that \Omega(n) = f_{1}(n) = O(n^3). Here…

We generalize a binary majority-vote model on adaptive networks to a plurality-vote counterpart. When opinions are uniformly distributed in the population of voters in the initial state, it is found that having more available opinions in…

This paper introduces a heterogeneous multidimensional bounded confidence (BC) opinion dynamics with random pairwise interactions, whereby each pair of agents accesses each other's opinions with a specific probability. This revised model is…