A full-information best-choice problem with finite memory

DOI10.2307/3214010MaRDI QIDQ3753199zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4147350
• On optimal choosing of one of the \(k\) best objects.
• scientific article; zbMATH DE number 939771
• Optimal Sequential Selection From a Known Distribution With Holding Costs
• Full-information best choice problems with recall of observations, uncertainty of selection and a random number of observations
• scientific article; zbMATH DE number 4104214
• An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation.
• scientific article; zbMATH DE number 3928135
• Sequential selection of an increasing subsequence from a sample of random size

Cited in

(10)

• A Full-Information Best-Choice Problem with Allowance
• scientific article; zbMATH DE number 2169730 (Why is no real title available?)
• An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
• Power-of-d-Choices with Memory: Fluid Limit and Optimality
• Robust best choice problem
• Remembrance of Zdzisław Porosiński (1955--2016)
• Recursive procedures for multiple decisions: Finite time memory and stepwise maximum likelihood procedure
• Full-information best choice game with hint
• A SEQUENTIAL DECISION PROBLEM WITH A FINITE MEMORY
• On the full information best-choice problem

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

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