Related papers: Fast plurality consensus in regular expanders
In approval voting, individuals vote for all platforms that they find acceptable. In this situation it is natural to ask: When is agreement possible? What conditions guarantee that some fraction of the voters agree on even a single…
We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently…
The constrained voter model describes the dynamics of opinions in a population of individuals located on a connected graph. Each agent is characterized by her opinion, where the set of opinions is represented by a finite sequence of…
Proportional representation (PR) is often discussed in voting settings as a major desideratum. For the past century or so, it is common both in practice and in the academic literature to jump to single transferable vote (STV) as the…
Majority dynamics on the binomial Erd\H{o}s-R\'enyi graph $\mathsf{G}(n,p)$ with $p=\lambda/\sqrt{n}$ is studied. In this process, each vertex has a state in $\{0,1\}$ and at each round, every vertex adopts the state of the majority of its…
We consider the problem of distributed multi-choice voting in a setting that each node can communicate with its neighbors merely by sending beep signals. Given its simplicity, the beep communication model is of practical importance in…
When opinions, behaviors or ideas diffuse within a population, some are invariably stickier than others. The stickier the opinion, behavior or idea, the greater is an individual's inertia to replace it with an alternative. Here we study the…
Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an $n$-node $d$-regular network for $d=\Omega(\log…
We investigate the coarsening kinetics in a long-range variant of the Persistent Voter Model in space dimension $d=1$ and 2. In this model agents can hold two confidence levels, normal and zealot. If normal, agents take the opinion of…
This paper considers elections in which voters choose one candidate each, independently according to known probability distributions. A candidate receiving a strict majority (absolute or relative, depending on the version) wins. After the…
Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…
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…
On the Web, there is always a need to aggregate opinions from the crowd (as in posts, social networks, forums, etc.). Different mechanisms have been implemented to capture these opinions such as "Like" in Facebook, "Favorite" in Twitter,…
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 the plurality consensus problem in distributed systems where a population of extremely simple agents, each initially holding one of $k$ opinions, aims to agree on the initially most frequent one. In this setting, $h$-majority is…
We consider a coupled Polya's urn scheme for social dynamics on networks. Agents hold continuum-valued opinions on a two-state issue and randomly converse with their neighbors on a graph, agreeing on one of the two states. The probability…
We present a tight analysis for the well-studied randomized 3-majority dynamics of stabilizing consensus, hence answering the main open question of Becchetti et al. [SODA'16]. Consider a distributed system of n nodes, each initially holding…
In the apportionment problem, a fixed number of seats must be distributed among parties in proportion to the number of voters supporting each party. We study a generalization of this setting, in which voters can support multiple parties by…
Opinion dynamics is crucial for unraveling the complexities of human interaction in the information age. How to speed up consensus without disturbing the fate of the system is key for opinion dynamics. We propose a voter model on adaptive…
We present a model of interacting multiple choices of opinions. At each step of the process, a listener is persuaded by his/her neighbour, the lobbyist, to modify his/her opinion on two different choices of event. Whether or not the…