Simple and Efficient Leader Election
Petra Berenbrink, Dominik Kaaser, Peter Kling, Lena Otterbach · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2018
We provide a simple and efficient population protocol for leader election that uses O(log n) states and elects exactly one leader in O(n (log n)^2) interactions with high probability and in expectation. Our analysis is simple and based on fundamental stochastic arguments. Our protocol combines the tournament based leader elimination by Alistarh and Gelashvili, ICALP'15, with the synthetic coin introduced by Alistarh et al., SODA'17.