von Neumann 和 Newman 有限牌堆扑克
von Neumann and Newman Pokers with Finite Decks
AI总结:
本文利用数值和符号计算研究有限牌堆的 von Neumann 和 Newman 简化扑克,并彻底分析了三人游戏,附带 Maple 实现。
摘要:
John von Neumann 研究了一种简化扑克,其中“牌堆”由无穷多张牌组成,实际上是介于 $0$ 和 $1$ 之间的所有实数。我们利用计算的力量(包括数值和符号计算)来研究具有有限张牌的类似问题。我们还研究了 D.J. Newman 引入的简化扑克的有限类似物,并最后对三人游戏进行了彻底的研究,该研究完全在 Maple 中实现,同时处理了有限和无限版本。本文附带两个 Maple 包和大量输出文件。
英文摘要:
John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between $0$ and $1$. We harness the power of computation, both numeric and symbolic, to investigate analogs with finitely many cards. We also study finite analogs of a simplified poker introduced by D.J. Newman, and conclude with a thorough investigation, fully implemented in Maple, of the three-player game, doing both the finite and the infinite versions. This paper is accompanied by two Maple packages and numerous output files.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。