Related papers: A leader-election procedure using records
In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…
In this paper, the leader election problem in the population protocol model is considered. A leader election protocol with logarithmic stabilization time is given. Given a rough knowledge m of the population size n such that m >= \log_2 n…
Leader election is a fundamental problem in distributed computing, particularly within programmable matter systems, where coordination among simple computational entities is crucial for solving complex tasks. In these systems, particles…
Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…
Population protocols are a relatively novel computational model in which very resource-limited anonymous agents interact in pairs with the goal of computing predicates. We consider the probabilistic version of this model, which naturally…
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coalesce into one cluster via a decentralized stochastic process,…
We have developed an experimental setup of very simple self-propelled robots to observe collective motion emerging as a result of inelastic collisions only. A circular pool and commercial RC boats were the basis of our first setup, where we…
Current approaches for collision avoidance and space traffic management face many challenges, mainly due to the continuous increase in the number of objects in orbit and the lack of scalable and automated solutions. To avoid catastrophic…
The population protocol model is a computational model for passive mobile agents. We address the leader election problem, which determines a unique leader on arbitrary communication graphs starting from any configuration. Unfortunately,…
Consider elections where the set of candidates is partitioned into parties, and each party must nominate exactly one candidate. The Possible President problem asks whether some candidate of a given party can become the winner of the…
The Poisson--Dirichlet distribution arises in many different areas. The parameter $\theta$ in the distribution is the scaled mutation rate of a population in the context of population genetics. The limiting case of $\theta$ approaching…
This paper treats a random collision model of three species, which is represented by the random time change of three standard Poisson processes. The prey-predator relation in the random collision model looks like paper-scissors-stone game,…
Consider an urn model where at each step one of $q$ colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball.…
A core tension in the study of plurality elections is the clash between the classic Hotelling-Downs model, which predicts that two office-seeking candidates should position themselves at the median voter's policy, and the empirical…
Condorcet's paradox is a fundamental result in social choice theory which states that there exist elections in which, no matter which candidate wins, a majority of voters prefer a different candidate. In fact, even if we can select any $k$…
In this paper, a partially observed stochastic linear Stackelberg differential game with mean-variance criteria is studied. Randomness comes from Brownian motions and Poisson random measures. which leads to a circular dependency. We follow…
Our model describes competition between groups driven by the choices of self-interested voters within groups. Within a Poisson voting environment, parties observe aggregate support from groups and can allocate prizes or punishments to them.…
In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
The Pitman-Yor process is a random discrete measure. The random weights or masses follow the two-parameter Poisson-Dirichlet distribution with parameters $0<\alpha<1, \theta>-\alpha$. The parameters $\alpha$ and $\theta$ correspond to the…