Adaptive approach to some stopping problems

DOI10.2307/3213867MaRDI QIDQ3697988zbMATH OpenOpenAlexFDO

Authors Mitsushi Tamaki

Publication date 1985

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

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

zbMATH Keywords

Bayesian analysisdynamic programmingparking problemsecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Foundations and philosophical topics in statistics (62A01) Bayesian problems; characterization of Bayes procedures (62C10) Optimal stopping in statistics (62L15) Adaptive control/observation systems (93C40)

Recommendations

• scientific article; zbMATH DE number 67283
• A SECRETARY PROBLEM WITH UNCERTAIN EMPLOYMENT WHEN THE NUMBER OF OFFERS IS RESTRICTED
• Where should you park your car? The $\frac{1}{2}$ rule
• A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates
• Optimal stopping in the parking problem with U-turn
• A unified approach to a class of best choice problems with an unknown number of options
• A note on Bruss' stopping problem with random availability
• SELECTING SATISFACTORY SECRETARIES

Cited in

(3)

• A note on the optimal stopping parking problem
• Optimal stopping in the parking problem with U-turn
• On Markov-dependent parking problems

This page was built for publication: Adaptive approach to some stopping problems

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