Simple and efficient leader election in the full information model

Rafail Ostrovsky, Sridhar Rajagopalan, Umesh Vazirani
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
In this paper, we study the leader election problem in the full information model. We show t w o results in this context. First, we exhibit a constructive Olog N round protocol that is resilient against linear size coalitions. That is, our protocol is resilient against any coalition of size less then N for some constant but small value of . Second, we provide an easy, non-constructive probabilistic argument that shows the existence of Olog N round protocol in which can be made as large as 1 2 ,
more » ... for any positive . Our protocols are extremely simple.
doi:10.1145/195058.195141 dblp:conf/stoc/OstrovskyRV94 fatcat:rrx4boyulfh7vlgqp2xugpksru