von Neumann and Newman Pokers with Finite Decks

By Tipaluck Krityakierne, Thotsaporn "Aek" Thanatipanonda, and Doron Zeilberger


.pdf    .tex   

First Written: July 22, 2024.

Last update of this web-page: Feb. 13, 2025


John von Neumann and Donald J. Newman proposed, and brilliantly solved, toy models of poker where the cards are drawn from an infinite deck (in fact very infinite, the set of real numbers from 0 to 1). We show the power of symbolic computation by implementing, and experimenting with, these models for finite decks of cards.
Added Oct. 30, 2024: Here are the slides of a talk by the first-named author on this paper.

Added Feb. 13, 2025: Here is Version 2, in some respects better, but in other respects worse, bowing to the referee's suggestions.


Pictures

John Nash and friends

Also See pictures,

Maple packages



Sample Input and Output for FinitePoker.txt