arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.00535math.PR
收藏

具有马尔可夫策略的迭代对策的递归马尔可夫过程

Recursive Markov Process for Iterated Games with Markov Strategies

Shohei Hidaka

摘要:

涉及多个玩家的游戏中的动态,他们从过去的经验中适应性地学习,还没有得到很好的理解。我们分析了一类具有马尔可夫策略的随机对策,其中局中人按概率选择他们的行动。这类被制定为一个$k^{\text{th}}$顺序马尔可夫过程,其中的选择概率是一个函数的$k$过去的状态。如果$k$相当大,或者$k \to \infty$有极限$k \to \infty$,则对该随机过程进行数值分析是不可行的。本研究发展了一种技术,给出了边际概率的平稳分布的无限阶马尔可夫过程,它可以递归地构建。我们应用这种技术来分析一个迭代囚徒困境游戏,两个球员谁学习使用无限的记忆。

英文摘要:

The dynamics in games involving multiple players, who adaptively learn from their past experience, is not yet well understood. We analyzed a class of stochastic games with Markov strategies in which players choose their actions probabilistically. This class is formulated as a $k^{\text{th}}$ order Markov process, in which the probability of choice is a function of $k$ past states. With a reasonably large $k$ or with the limit $k \to \infty$, numerical analysis of this random process is unfeasible. This study developed a technique which gives the marginal probability of the stationary distribution of the infinite-order Markov process, which can be constructed recursively. We applied this technique to analyze an iterated prisoner's dilemma game with two players who learn using infinite memory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑