弱非循环对策的一个分类
A Classification of Weakly Acyclic Games
摘要：
弱非循环游戏形成了具有有限改进属性（FIP）的游戏类别的自然推广。在这样的博弈中，人们规定，从任何初始的联合策略开始，都存在有限的改进路径。我们使用arXiv：1202.2209中引入的调度器概念对弱非循环游戏进行分类。我们还表明，有限的游戏，可以解决的迭代消除从来没有最佳对策策略是弱非循环的。最后，我们解释了如何使我们能够改善边界上找到一个纳什均衡在弱非循环的游戏。
英文摘要：
Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). In such games one stipulates that from any initial joint strategy some finite improvement path exists. We classify weakly acyclic games using the concept of a scheduler introduced in arXiv:1202.2209. We also show that finite games that can be solved by the iterated elimination of never best response strategies are weakly acyclic. Finally, we explain how the schedulers allow us to improve the bounds on finding a Nash equilibrium in a weakly acyclic game.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
