Playing With Population Protocols

Olivier Bournez
Jérémie Chalopin
Johanne Cohen
Xavier Koegler

Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous agents, modeled by finite automata, interact in pairs according to some rules.

Predicates on the initial configurations that can be computed by such protocols have been characterized under several hypotheses.

We discuss here whether and when the rules of interactions between agents can be seen as a game from game theory. We do so by discussing several basic protocols.

In Turlough Neary, Damien Woods, Tony Seda and Niall Murphy: Proceedings International Workshop on The Complexity of Simple Programs (CSP 2008), Cork, Ireland, 6-7th December 2008, Electronic Proceedings in Theoretical Computer Science 1, pp. 3–15.
Published: 25th June 2009.

ArXived at: http://dx.doi.org/10.4204/EPTCS.1.1 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org