A full-information best-choice problem with finite memory

DOI10.2307/3214010zbMath0612.60043OpenAlexW2329429727MaRDI QIDQ3753199

Mitsushi Tamaki

Publication date: 1986

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214010

zbMATH Keywords

optimal stopping timesecretary problemfinite memoryfull information

Mathematics Subject Classification ID

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

Related Items (5)

Robust best choice problem ⋮ Zdzisław Józef Porosiński: wspomnienie ⋮ Full-information best choice game with hint ⋮ A Full-Information Best-Choice Problem with Allowance ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object

This page was built for publication: A full-information best-choice problem with finite memory