A Full-Information Best-Choice Problem with Allowance

DOI10.1017/S0269964800004162MaRDI QIDQ5485354zbMATH OpenOpenAlexFDO

Authors Mitsushi Tamaki, J. George Shanthikumar

Publication date 30 August 2006

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0269964800004162

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Management decision making, including multiple objectives (90B50) Dynamic programming (90C39)

Recommendations

• Full-information best choice problems with recall of observations, uncertainty of selection and a random number of observations
• scientific article; zbMATH DE number 3901857
• scientific article; zbMATH DE number 247109
• scientific article; zbMATH DE number 1547871
• The best choice problem with complete information and disordering

Cites work

• A full-information best-choice problem with finite memory
• Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation
• Minimizing the expected rank with full information
• On an optimal stopping problem of Gusein-Zade
• Selecting the Maximum of a Sequence with Imperfect Information

Cited in

(3)

• The full-information best-choice problem with uniform or gamma horizons
• scientific article; zbMATH DE number 3862278 (Why is no real title available?)
• On the full information best-choice problem

This page was built for publication: A Full-Information Best-Choice Problem with Allowance

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