An $O({\log }^{3/2}n)$ Parallel Time Population Protocol for Majority with $O(\log n)$ States

Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus +1

In population protocols, the underlying distributed network consists of $n$ nodes (or agents), denoted by $V$, and a scheduler that continuously selects uniformly random pairs of n…