arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.13019math.OC
收藏

求解随机对策的新算法

New algorithms for solving stochastic games

Miquel Oliu-Barton

摘要:

随机对策是对策论中的一个经典模型,其中两个对手相互作用,环境响应于玩家的行为而变化。这些游戏的核心解决方案概念是贴现值和价值,这代表了玩家在不同的不耐烦程度下玩游戏的价值。在本手稿中,我们提供的算法计算精确表达式的折扣值和价值,这是多项式的纯静态策略的球员。这一结果大大改善了所有现有的算法,包括最有效的一个,由于汉森,Kouckloven,劳里岑,Miltersen和Tsigaridas(STOC 2011)。

英文摘要:

Stochastic games are a classical model in game theory in which two opponents interact and the environment changes in response to the players' behavior. The central solution concepts for these games are the discounted values and the value, which represent what playing the game is worth to the players for different levels of impatience. In the present manuscript, we provide algorithms for computing exact expressions for the discounted values and for the value, which are polynomial in the number of pure stationary strategies of the players. This result considerably improves all the existing algorithms, including the most efficient one, due to Hansen, Koucký, Lauritzen, Miltersen and Tsigaridas (STOC 2011).

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

↑