Triangular numbers and the N-sided die optimal stopping problem

DOI10.1080/0025570X.2021.1951574zbMATH Open1505.60047OpenAlexW3199172755MaRDI QIDQ5019906FDOQ5019906

Authors: Bennett Eisenberg 

Publication date: 11 January 2022

Published in: Mathematics Magazine (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0025570x.2021.1951574

Recommendations

• Optimal Stopping in a Dice Game
• A prisoner problem variation
• A finite exact algorithm to solve a dice game
• Contribution to the optimal stopping problem
• Recent studies on the dice race problem and its connections

Mathematics Subject Classification ID

Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Cites Work

• House-hunting without second moments
• Dynamic programming of some sequential sampling design
• On optimal stopping rules

Cited In (2)

• The 6666 problem
• Expected characteristic in Tunnels \& Trolls character creation, with generalizations

This page was built for publication: Triangular numbers and the \(N\)-sided die optimal stopping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5019906)