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

计算约束下博弈中的预计算建模

Modeling Precomputation In Games Played Under Computational Constraints

Thomas Orton

摘要:

理解在计算约束下进行的游戏的性质仍然具有挑战性。例如,我们如何期望理性(但计算有限)的参与者进行具有大量状态的游戏,如国际象棋?本文提出了一种新的模型的预计算(提前准备移动)方面的计算约束的游戏。一个基本的权衡之间的随机性发挥,和易感性预先计算,这表明随机化是必要的,在游戏中的计算约束。我们提出了有效的算法来计算如何敏感的策略是预先计算,并计算我们的模型的$ε$ -纳什均衡。数值实验测量随机性和预计算之间的权衡提供Stockfish(一个著名的国际象棋算法)。

英文摘要:

Understanding the properties of games played under computational constraints remains challenging. For example, how do we expect rational (but computationally bounded) players to play games with a prohibitively large number of states, such as chess? This paper presents a novel model for the precomputation (preparing moves in advance) aspect of computationally constrained games. A fundamental trade-off is shown between randomness of play, and susceptibility to precomputation, suggesting that randomization is necessary in games with computational constraints. We present efficient algorithms for computing how susceptible a strategy is to precomputation, and computing an $ε$-Nash equilibrium of our model. Numerical experiments measuring the trade-off between randomness and precomputation are provided for Stockfish (a well-known chess playing algorithm).

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

↑