全街简化三人库恩扑克
Full street simplified three player Kuhn poker
摘要:
我们研究了一个简化版的全街,三人库恩扑克,其中最弱的卡,J,必须检查和/或折叠的球员谁持有它,必须计算的非平凡的投注频率的数量,从而减少到11个,所有的平衡解决方案,可以找到分析。特别是,有三个范围的壶大小,$P$的值,有三个不同的,共存的平衡解决方案。我们还研究了一个常微分方程模型的重复玩的游戏,我们希望至少是定性准确的,当所有的球员都调整他们的投注频率足够慢,有足够短的记忆。我们发现,没有一个博弈的平衡解是渐近稳定的常微分方程的解。根据罐的大小,解决方案可能是周期性的,接近周期性或具有长的混沌瞬态。在每一种情况下,参与者积累利润的速度都与博弈的一个均衡解密切相关。
英文摘要:
We study a simplified version of full street, three player Kuhn poker, in which the weakest card, J, must be checked and/or folded by a player who holds it. The number of nontrivial betting frequencies that must be calculated is thereby reduced from 23 to 11, and all equilibrium solutions can be found analytically. In particular, there are three ranges of values of the pot size, $P$, for which there are three distinct, coexisting equilibrium solutions. We also study an ordinary differential equation model of repeated play of the game, which we expect to be at least qualitatively accurate when all players both adjust their betting frequencies sufficiently slowly and have sufficiently short memories. We find that none of the equilibrium solutions of the game is asymptotically stable as a solution of the ordinary differential equations. Depending on the pot size, the solution may be periodic, close to periodic or have long chaotic transients. In each case, the rates at which the players accumulate profit closely match those associated with one of the equilibrium solutions of the game.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。