von Neumann and Newman Pokers with Finite Decks
Computer Science and Game Theory
2024-07-24 v1 Combinatorics
Abstract
John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between and . 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.
Cite
@article{arxiv.2407.16155,
title = {von Neumann and Newman Pokers with Finite Decks},
author = {Tipaluck Krityakierne and Thotsaporn Aek Thanatipanonda and Doron Zeilberger},
journal= {arXiv preprint arXiv:2407.16155},
year = {2024}
}