scientific article; zbMATH DE number 758012

MaRDI QIDQ4833957zbMATH OpenFDO

Authors Minoru Sakaguchi, Vesa Saario

Publication date 2 November 1995

zbMATH Keywords

Bellman equationsbest-choice problemfull informationoptimal strategyoptimality equationrecursive solutions

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Dynamic programming (90C39) Applications of mathematical programming (90C90)

Recommendations

• The full-information best choice problem with a random number of observations
• Optimal stopping problems with generalized objective functions
• Best choice problem for diserete bandom variables
• scientific article; zbMATH DE number 4135127
• scientific article; zbMATH DE number 3901857

Cited in

(7)

• Running minimum in the best-choice problem
• scientific article; zbMATH DE number 3862278 (Why is no real title available?)
• Best choice problem for diserete bandom variables
• On the full information best-choice problem
• scientific article; zbMATH DE number 4115649 (Why is no real title available?)
• On approximative solutions of multistopping problems
• Analytic insights into an adapted algorithm for the score-based secretary problem

This page was built for publication:

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