论文标题
连续肠扑克和广义递归游戏的数值优化
Continuous guts poker and numerical optimization of generalized recursive games
论文作者
论文摘要
我们研究了Castronova，Chen和Zumbrun引入的一种广义递归游戏，其赌注越来越多，重点是连续的胆量扑克，$ 1 $v。$ n $ v。$ n $ coalitions。我们的主要结果是开发具有严格的基本理论的实用数值算法，以逼近最佳脉动策略，并使用这些理论来获得有关胆量的许多有趣的观察结果。成果是$ n $ - 玩家联盟的惊人2策略最佳，渐近优势约为$ 16 \％$;虚拟游戏与对称纳什平衡的收敛；以及一个恶意的互动$ n $ - 玩家“ bot”进行演示。
We study a type of generalized recursive game introduced by Castronova, Chen, and Zumbrun featuring increasing stakes, with an emphasis on continuous guts poker and $1$ v. $n$ coalitions. Our main results are to develop practical numerical algorithms with rigorous underlying theory for the approximation of optimal mutiplayer strategies, and to use these to obtain a number of interesting observations about guts. Outcomes are a striking 2-strategy optimum for $n$-player coalitions, with asymptotic advantage approximately $16\%$; convergence of Fictitious Play to symmetric Nash equilibrium; and a malevolent interactive $n$-player "bot" for demonstration.
