We consider the problem of distributed -party voting with two choices as well as a simple modification of this protocol in complete graphs. In the standard version, we are given a graph in which every node possesses one of different opinions at the beginning. In each step, every node chooses two neighbors uniformly at random. If the opinions of the two neighbors coincide, then this opinion is adopted. It is known that if and the difference between the two opinions is , then after steps, every node will possess the largest initial opinion, with high probability. We show that if for some small , then this protocol converges to the initial majority within steps, with high probability, as long as the initial difference between the largest and second largest opinion is . Furthermore, there exist initial configurations where the bound on the run time is matched. If the initial difference is , then the largest opinion may loose the vote with constant probability. To speed up our process, we consider the following variant of the two-choices protocol. The process is divided into several phases, and in the first step of a phase every node applies the two choices protocol. If a new opinion is adopted, the node remembers it by setting a certain bit to true. In the subsequent steps of that phase, each node samples one neighbor, and if the bit of this neighbor is set to true, then the node takes the opinion of this neighbor and sets its bit to true as well. At the end of the phase, the bits are reset to false. Then, the phases are repeated several times. We show that this modified protocol improves significantly over the standard two-choices protocol.
View on arXiv