Asymetric Pavlovian Populations

Details Asymetric Pavlovian Populations Asymetric Pavlovian Populations

2011-09-20

arxiv.org/abs/1109.4433v1

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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 restric- tion: 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.

Affiliated with

Also associated with

No associations

Rating

Asymetric Pavlovian Populations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymetric Pavlovian Populations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymetric Pavlovian Populations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256760