Computing with Pavlovian Populations - École polytechnique Access content directly
Conference Papers Year : 2011

Computing with Pavlovian Populations

Abstract

Population protocols have been introduced by Angluin et {al.} as a model of networks consisting of very limited mobile agents that interact in pairs but with no control over their own movement. A collection of anonymous agents, modeled by finite automata, interact pairwise according to some rules that update their states. Predicates on the initial configurations that can be computed by such protocols have been characterized as semi-linear predicates. In an orthogonal way, several distributed systems have been termed in literature as being realizations of games in the sense of game theory. We investigate under which conditions population protocols, or more generally pairwise interaction rules, correspond to games. We show that restricting to asymetric games is not really a restriction: all predicates computable by protocols can actually be computed by protocols corresponding to games, i.e. any semi-linear predicate can be computed by a Pavlovian population multi-protocol.
Fichier principal
Vignette du fichier
submitted.pdf (211.77 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00760778 , version 1 (04-12-2012)

Identifiers

  • HAL Id : hal-00760778 , version 1

Cite

Olivier Bournez, Jérémie Chalopin, Johanne Cohen, Xavier Koegler, Mikaël Rabie. Computing with Pavlovian Populations. Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, 2011, France. pp.409-420. ⟨hal-00760778⟩
238 View
170 Download

Share

Gmail Mastodon Facebook X LinkedIn More