Convergence of the Iterated Prisoner's Dilemma Game
Combinatorics, Probability and Computing
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Coupling and self-stabilization
Distributed Computing - Special issue: DISC 04
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Computing with large populations using interactions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
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.