On asymptotic fairness in voting with greedy sampling
On asymptotic fairness in voting with greedy sampling
Abstract The basic idea of voting protocols is that nodes query a sample of other nodes and adjust their own opinion throughout several rounds based on the proportion of the sampled opinions. In the classic model, it is assumed that all nodes have the same weight. We study voting protocols …