具有重复确定性的游戏
Games with recurring certainty
摘要:
在不完全信息下,几个参与者寻求协调的无限博弈是难以处理的,除非信息流受到严格限制。不可判定案例的典型特征是玩家对游戏的当前状态变得不确定,并且这种不确定性永远持续下去。在这里,我们考虑的游戏中,球员获得确定性的当前状态一遍又一遍地沿着任何发挥。对于有限状态博弈,我们注意到这种循环确定性意味着周期确定性的更强条件,即状态确定性的事件最终以均匀的规则间隔发生。我们表明,它是决定是否一个给定的游戏呈现经常性的确定性,如果是这样的话,在W-经常获胜的条件下,合成协调策略的问题是可解的。
英文摘要:
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players become uncertain about the current state of the game, and this uncertainty lasts forever. Here we consider games where the players attain certainty about the current state over and over again along any play. For finite-state games, we note that this kind of recurring certainty implies a stronger condition of periodic certainty, that is, the events of state certainty ultimately occur at uniform, regular intervals. We show that it is decidable whether a given game presents recurring certainty, and that, if so, the problem of synthesising coordination strategies under w-regular winning conditions is solvable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。