A Full-Information Best-Choice Problem with Allowance

DOI10.1017/S0269964800004162zbMath1095.60504OpenAlexW2108772681MaRDI QIDQ5485354

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

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

Related Items (1)

The full-information best-choice problem with uniform or gamma horizons

Cites Work

• On an optimal stopping problem of Gusein-Zade
• 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
• Selecting the Maximum of a Sequence with Imperfect Information
• Minimizing the expected rank with full information

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