The Power of Two Choices in Distributed Voting

@inproceedings{Cooper2014ThePO,
  title={The Power of Two Choices in Distributed Voting},
  author={Colin Cooper and Robert Els{\"a}sser and Tomasz Radzik},
  booktitle={ICALP},
  year={2014}
}
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion. On many graph classes including regular graphs, pull voting requires $\Theta(n)$ expected steps to complete, even if initially there are only two distinct opinions. In this paper we consider a related process which we call two-sample voting: every vertex… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 34 CITATIONS

Best-of-Three Voting on Dense Graphs

VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS