Related papers: Discrete Incremental Voting
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…
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…
Aggregating preferences under incomplete or constrained feedback is a fundamental problem in social choice and related domains. While prior work has established strong impossibility results for pairwise comparisons, this paper extends the…
We investigate a model for opinion dynamics, where individuals (modeled by vertices of a graph) hold certain abstract opinions. As time progresses, neighboring individuals interact with each other, and this interaction results in a…
We study a variant of the voter model on a coevolving network in which interactions of two individuals with differing opinions only lead to an agreement on one of these opinions with a fixed probability $q$. Otherwise, with probability…
Comparing the differences in outcomes (that is, in "dependent variables") between two subpopulations is often most informative when comparing outcomes only for individuals from the subpopulations who are similar according to "independent…
Consider an Galton Watson tree of height $m$: each leaf has one of $k$ opinions or not. In other words, for $i \in \{1, . . . , k\}$, $x$ at generation $m$ thinks $i$ with probability $p_i$ and nothing with probability $p_0$. Moreover the…
This paper gives lower bounds for the probability of consensus for two spatially explicit stochastic opinion models. Both processes are characterized by two finite connected graphs, that we call respectively the spatial graph and the…
Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its opinion according to a predefined common local updating rule.…
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…
We study noise sensitivity of the consensus opinion of the voter model on finite graphs, with respect to noise affecting the initial opinions and noise affecting the dynamics. We prove that the final opinion is stable with respect to small…
We model voting behaviour in the multi-group setting of a two-tier voting system using sequences of de Finetti measures. Our model is defined by using the de Finetti representation of a probability measure (i.e. as a mixture of…
This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the voter model, individuals are located on the vertex set of a connected graph and update their opinion at a constant rate…
This article aims to present a unified framework for grading-based voting processes. The idea is to represent the grades of each voter on d candidates as a point in R^d and to define the winner of the vote using the deepest point of the…
In this paper, we consider the voter model with popularity bias. The influence of each node on its neighbors depends on its degree. We find the consensus probabilities and expected consensus times for each of the states. We also find the…
In the voter model, each node of a graph has an opinion, and in every round each node chooses independently a random neighbour and adopts its opinion. We are interested in the consensus time, which is the first point in time where all nodes…
We introduce the confident voter model, in which each voter can be in one of two opinions and can additionally have two levels of commitment to an opinion --- confident and unsure. Upon interacting with an agent of a different opinion, a…
We consider $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice…
News outlets, surveyors, and other organizations often conduct polls on social networks to gain insights into public opinion. Such a poll is typically started by someone on a social network who sends it to her friends. If a person…
In the voter model, vertices of a graph (interpreted as voters) adopt one out of two opinions (0 and 1), and update their opinions at random times by copying the opinion of a neighbor chosen uniformly at random. This process is dual to a…