arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.3302cs.GTcs.MA
收藏

博弈中有界的不完全回忆抽象

Imperfect-Recall Abstractions with Bounds in Games

Christian Kroer, Tuomas Sandholm

摘要:

不完全回忆抽象已经成为不完全信息博弈中实际大规模均衡计算的主要范式。然而,对查全率抽象的理解很少,并且只知道对解决方案质量的弱算法特定保证。在本文中,我们展示了第一个一般的,算法不可知的,解决方案的质量保证的纳什均衡和近似自颤抖的平衡计算的回忆抽象,当实现在原来的(完美的回忆)游戏。我们的研究结果是一类游戏,概括了唯一以前已知的类的不确定性召回抽象的任何结果已经获得。此外,我们的分析在两个方面更紧密,每一个都可以导致解决方案质量误差界的指数下降。然后,我们表明,扩展形式的游戏,满足一定的属性,计算一个单一的游戏水平的边界最小化抽象的问题减少到一个聚类问题,在我们的边界的增加是距离函数。这种减少导致了第一个解决方案的质量边界的不确定召回抽象算法。我们继续展示抽象问题类中的一个划分。如果在所有考虑抽象的信息集上,收益都处于相同的尺度,则输入形成度量空间。相反,如果这个条件不满足,我们证明输入不形成度量空间。最后,我们使用这些结果进行实验研究的质量,我们的绑定单级抽象。

英文摘要:

Imperfect-recall abstraction has emerged as the leading paradigm for practical large-scale equilibrium computation in incomplete-information games. However, imperfect-recall abstractions are poorly understood, and only weak algorithm-specific guarantees on solution quality are known. In this paper, we show the first general, algorithm-agnostic, solution quality guarantees for Nash equilibria and approximate self-trembling equilibria computed in imperfect-recall abstractions, when implemented in the original (perfect-recall) game. Our results are for a class of games that generalizes the only previously known class of imperfect-recall abstractions where any results had been obtained. Further, our analysis is tighter in two ways, each of which can lead to an exponential reduction in the solution quality error bound. We then show that for extensive-form games that satisfy certain properties, the problem of computing a bound-minimizing abstraction for a single level of the game reduces to a clustering problem, where the increase in our bound is the distance function. This reduction leads to the first imperfect-recall abstraction algorithm with solution quality bounds. We proceed to show a divide in the class of abstraction problems. If payoffs are at the same scale at all information sets considered for abstraction, the input forms a metric space. Conversely, if this condition is not satisfied, we show that the input does not form a metric space. Finally, we use these results to experimentally investigate the quality of our bound for single-level abstraction.

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

↑