Stabilizing Consensus with Many Opinions

@inproceedings{Becchetti2016StabilizingCW,
  title={Stabilizing Consensus with Many Opinions},
  author={Luca Becchetti and Andrea E. F. Clementi and Emanuele Natale and Francesco Pasquale and Luca Trevisan},
  booktitle={SODA},
  year={2016}
}
We consider the following distributed consensus problem: Each node in a complete communication network of size n initially holds an opinion, which is chosen arbitrarily from a finite set Σ. The system must converge toward a consensus state in which all, or almost all nodes, hold the same opinion. Moreover, this opinion should be valid, i.e., it should be one among those initially present in the system. This condition should be met even in the presence of an adaptive, malicious adversary who can… CONTINUE READING

Citations

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

Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A symbiotic perspective on distributed algorithms and social insects

VIEW 6 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND
HIGHLY INFLUENCED

Tight Analysis for the 3-Majority Consensus Dynamics

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Similar Papers

Loading similar papers…