我们如何在随机策略中记住过去?
How do we remember the past in randomised strategies?
摘要:
无限长的图游戏是开放反应过程的自然模型:一个参与者代表控制者,试图确保给定的规范,另一个代表敌对的环境。系统的演变取决于双方的决策,并辅以偶然性。在这项工作中,我们专注于随机策略的概念。更具体地说,我们表明,三个自然的定义可能会导致非常不同的结果:在最一般的情况下,一个几乎肯定会赢的情况下,可能会成为几乎肯定会输,如果玩家只允许使用一个较弱的战略概念。在更合理的设置中,存在翻译,但它们需要无限的内存,即使在简单的情况下。最后,一些传统的问题变得不可判定的最强类型的战略。
英文摘要:
Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。