Related papers: Discrete Incremental Voting on Expanders
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on 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…
Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…
A method is given for quantitatively rating the social acceptance of different options which are the matter of a preferential vote. In contrast to a previous article, here the individual votes are allowed to be incomplete, that is, they…
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…
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…
A "repeat voting" procedure is proposed, whereby voting is carried out in two identical rounds. Every voter can vote in each round, the results of the first round are made public before the second round, and the final result is determined…
Confounder selection, namely choosing a set of covariates to control for confounding between a treatment and an outcome, is arguably the most important step in the design of an observational study. Previous methods, such as Pearl's…
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 consider two-opinion voter models on dense dynamic random graphs. Our goal is to understand and describe the occurrence of consensus versus polarisation over long periods of time. The former means that all vertices have the same opinion,…
An important aspect of AI design and ethics is to create systems that reflect aggregate preferences of the society. To this end, the techniques of social choice theory are often utilized. We propose a new social choice function motivated by…
In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions using local operations. A natural algorithm to achieve this is…
The voter model with the node update rule is numerically investigated on a directed network. We start from a directed hierarchical tree, and split and rewire each incoming arc at the probability $p$. In order to discriminate the better and…
The adaptive voter model is widely used to model opinion dynamics in social complex networks. However, existing adaptive voter models are limited to only pairwise interactions and fail to capture the intricate social dynamics that arises in…
The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…
Given a transition matrix $P$ indexed by a finite set $V$ of vertices, the voter model is a discrete-time Markov chain in $\{0,1\}^V$ where at each time-step a randomly chosen vertex $x$ imitates the opinion of vertex $y$ with probability…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
Judgment aggregation problems form a class of collective decision-making problems represented in an abstract way, subsuming some well known problems such as voting. A collective decision can be reached in many ways, but a direct one-step…
Voter control problems model situations such as an external agent trying to affect the result of an election by adding voters, for example by convincing some voters to vote who would otherwise not attend the election. Traditionally, voters…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…