Population protocols that correspond to symmetric games. - Equipe : Graphes, Algorithmes et Combinatoire Accéder directement au contenu
Article Dans Une Revue International Journal of Unconventional Computing Année : 2013

Population protocols that correspond to symmetric games.

Résumé

Population protocols have been introduced by Angluin et al. as a model of networks consisting of very limited mobile anonymous agents that interact in pairs but with no control over their own movement. The model has been considered as a computational model. In an orthogonal way, several distributed systems have been termed in literature as being realizations of games in the sense of game theory. In this paper, we investigate under which conditions population proto- cols, or more generally pairwise interaction rules, can be considered as the result of a symmetric game. We prove that not all symmetric rules can be considered as symmet- ric games. We prove that some basic protocols can be realized using symmetric games.
Fichier non déposé

Dates et versions

hal-01303147 , version 1 (16-04-2016)

Identifiants

  • HAL Id : hal-01303147 , version 1

Citer

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikael Rabie. Population protocols that correspond to symmetric games.. International Journal of Unconventional Computing, 2013, 9 ((1-2)), pp.5-36. ⟨hal-01303147⟩
363 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More