A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time
[article]

2017
*
arXiv
*
pre-print

We consider the model of population protocols, which can be viewed as a sequence of random pairwise interactions of n agents (nodes). We show population protocols for two problems: the leader election and the exact majority voting. The leader election starts with all agents in the same initial state and the goal is to converge to the (global) state when exactly one agent is in a distinct state L. The exact majority voting starts with each agent in one of the two distinct states A or B and the

arXiv:1705.01146v1
fatcat:ynf7cxqjxbchdhu53bjp73dnb4