Parametric Analysis of Von Neumann and Morgenstern's Discrete Poker Model for Deck Sizes <i>S</i> = 2 Through <i>S</i> = 5

We derive optimal strategies for the discrete poker model of von Neumann and Morgenstern for deck sizes S = 2 through S = 5 for all values of p &gt; 1 where p is the ratio of the high and low bids available to the players. Primary results are (1) for S = 2, there are two optimal pure strategies that apply to different values of p; (2) for S = 3, there are two optimal pure strategies for 1 &lt; p ≤ 2, a family of optimal mixed strategies for 2 &lt; p &lt; 4, discontinuous at the endpoints, and an optimal pure strategy for 4 ≤ p; and (3) for S = 4 and S = 5, there are optimal pure strategies for low and high values of p, as well as three or six optimal mixed strategies, respectively, for intermediate values of p, which exhibit multiple discontinuities. In contrast to the previous authors results for the continuous case (where each player is dealt a real number between 0 and 1), for small values of p, players should always bid high, and for sufficiently large values of p, players should bid high only when dealt the maximum value S. In between, the optimal mixed strategies are numerous and behave precariously. We combine empirical results with formal analysis to explain the observed behavior and to indicate what to expect for larger values of S.

Authors

Publication Details

Journal
International Game Theory Review
Published
2026-05-29
DOI
https://doi.org/10.1142/s0219198926500131
Primary Topic
Gambling Behavior and Treatments
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Parametric Analysis of Von Neumann and Morgenstern's Discrete Poker Model for Deck Sizes S = 2 Through S = 5

Bruce Ballard
International Game Theory Review
Gambling Behavior and Treatments
article

Parametric Analysis of Von Neumann and Morgenstern's Discrete Poker Model for Deck Sizes S = 2 Through S = 5

Bruce Ballard
article en

Abstract

We derive optimal strategies for the discrete poker model of von Neumann and Morgenstern for deck sizes S = 2 through S = 5 for all values of p &gt; 1 where p is the ratio of the high and low bids available to the players. Primary results are (1) for S = 2, there are two optimal pure strategies that apply to different values of p; (2) for S = 3, there are two optimal pure strategies for 1 &lt; p ≤ 2, a family of optimal mixed strategies for 2 &lt; p &lt; 4, discontinuous at the endpoints, and an optimal pure strategy for 4 ≤ p; and (3) for S = 4 and S = 5, there are optimal pure strategies for low and high values of p, as well as three or six optimal mixed strategies, respectively, for intermediate values of p, which exhibit multiple discontinuities. In contrast to the previous authors results for the continuous case (where each player is dealt a real number between 0 and 1), for small values of p, players should always bid high, and for sufficiently large values of p, players should bid high only when dealt the maximum value S. In between, the optimal mixed strategies are numerous and behave precariously. We combine empirical results with formal analysis to explain the observed behavior and to indicate what to expect for larger values of S.

International Game Theory Review
Openalex Percentile: Top 5%
Gambling Behavior and Treatments
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.