Efficient plurality consensus, or: The benefits of cleaning up from time to time
From MaRDI portal
Publication:4598279
DOI10.4230/LIPIcs.ICALP.2016.136zbMath1388.68014OpenAlexW2512254926MaRDI QIDQ4598279
George Giakkoupis, Petra Berenbrink, Peter Kling, Tom Friedetzky
Publication date: 19 December 2017
Full work available at URL: https://hal.archives-ouvertes.fr/hal-01353690
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12)
Related Items (4)
Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model ⋮ Distributed Averaging in Opinion Dynamics ⋮ Phase transition of the 2-choices dynamics on core-periphery networks ⋮ Noisy rumor spreading and plurality consensus
This page was built for publication: Efficient plurality consensus, or: The benefits of cleaning up from time to time