Simple dynamics for plurality consensus

Luca Becchetti (1) , Andrea Clementi (2) , Emanuele Natale (1) , Francesco Pasquale (1) , Riccardo Silvestri (1) , Luca Trevisan (3)

1 UNIROMA - Università degli Studi di Roma "La Sapienza" = Sapienza University [Rome]
2 Università degli Studi di Roma Tor Vergata [Roma] = University of Rome Tor Vergata
3 Berkeley EECS - Department of Electrical Engineering and Computer Sciences

We study a Plurality-Consensus process in which each of n anonymous agents of a communication network initially supports a color chosen from the set [k]. Then, in every round, each agent can revise his color according to the colors currently held by a random sample of his neighbors. It is assumed that the initial color configuration exhibits a sufficiently large bias s towards a fixed plurality color, that is, the number of nodes supporting the plurality color exceeds the number of nodes supporting any other color by s additional nodes. The goal is having the process to converge to the stable configuration in which all nodes support the initial plurality. We consider a basic model in which the network is a clique and the update

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, et al.. Simple dynamics for plurality consensus. Distributed Computing, 2017, 30 (4), pp.293-306. ⟨10.1007/s00446-016-0289-4⟩. ⟨hal-02002637⟩