不对称巴甫洛夫种群
Asymetric Pavlovian Populations
摘要：
人口协议已被引入由Angluin等人。作为一个模型的网络组成的非常有限的移动代理人进行交互对，但没有控制自己的运动。一个匿名代理的集合，由有限自动机建模，根据一些规则，更新他们的状态进行交互。可以通过这样的协议计算的初始配置上的谓词已经被表征为半线性谓词。在一个正交的方式，几个分布式系统已被称为在文献中的实现游戏的意义上的博弈论。我们调查在何种条件下人口协议，或更一般的成对的相互作用规则，对应于游戏。我们表明，限制到非对称的游戏是不是真的限制：所有的谓词计算的协议实际上可以计算的协议对应的游戏，即任何半线性谓词可以计算的巴甫洛夫人口多协议。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
