Computer Science – Computer Science and Game Theory
Scientific paper
2009-07-17
Computer Science
Computer Science and Game Theory
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. The model has been considered as a computational model in several papers. Input values are initially distributed among the agents, and the agents must eventually converge to the the correct output. Predicates on the initial configurations that can be computed by such protocols have been characterized under various hypotheses. 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 protocols, or more generally pairwise interaction rules, can be considered as the result of a symmetric game. We prove that not all rules can be considered as symmetric games.% We prove that some basic protocols can be realized using symmetric games. As a side effect of our study, we also prove that any population protocol can be simulated by a symmetric one (but not necessarily a game).
Bournez Olivier
Chalopin Jeremie
Cohen Johanne
Koegler Xavier
No associations
LandOfFree
Population Protocols that Correspond to Symmetric Games 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 Population Protocols that Correspond to Symmetric Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Population Protocols that Correspond to Symmetric Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-111133