论文标题

通过交流来表征有限状态自动机队游戏的可决定性

Characterizing the Decidability of Finite State Automata Team Games with Communication

论文作者

Coulombe, Michael, Lynch, Jayson

论文摘要

在本文中,我们为多人团队游戏的不完美信息定义了有限的沟通模型。我们证明,当玩家的沟通速度少于他们在游戏中的动作速度时,DFA游戏和团队配方游戏的界限一直是不可决定的。我们还表明,达到这种沟通阈值会导致这些游戏可决定。

In this paper we define a new model of limited communication for multiplayer team games of imperfect information. We prove that the Team DFA Game and Team Formula Game, which have bounded state, remain undecidable when players have a rate of communication which is less than the rate at which they make moves in the game. We also show that meeting this communication threshold causes these games to be decidable.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源