arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1107.1653math.OCcs.NAmath.NA
收藏

两人零和随机博弈的多重网格方法

Multigrid methods for two-player zero-sum stochastic games

Marianne Akian, Sylvie Detournay

AI总结:

提出结合策略迭代与代数多重网格的快速数值算法,用于大规模完美信息零和随机博弈,并应用于Isaacs方程离散化。

摘要:

我们提出了一种用于大规模完美信息零和随机博弈的快速数值算法,该算法结合了策略迭代和代数多重网格方法。该算法可应用于真正的有限状态空间两人零和博弈,也可应用于Isaacs方程的离散化。我们给出了Isaacs方程或变分不等式离散化的数值测试。我们还提出了一种类似于FMG的全多层策略迭代,该方法可显著缩短求解某些变分不等式的计算时间。

英文摘要:

We present a fast numerical algorithm for large scale zero-sum stochastic games with perfect information, which combines policy iteration and algebraic multigrid methods. This algorithm can be applied either to a true finite state space zero-sum two player game or to the discretization of an Isaacs equation. We present numerical tests on discretizations of Isaacs equations or variational inequalities. We also present a full multi-level policy iteration, similar to FMG, which allows to improve substantially the computation time for solving some variational inequalities.

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

↑