A Best-Choice Problem With Linear Travel Cost

DOI10.2307/2287915MaRDI QIDQ3703139zbMATH OpenOpenAlexFDO

Authors Stephen M. Samuels

Publication date 1985

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

zbMATH Keywords

backward inductionoptimal selectionrecallsecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Decision theory for games (91A35)

Recommendations

• scientific article; zbMATH DE number 572375
• scientific article; zbMATH DE number 3986306
• Interview Costs in the Secretary Problem
• scientific article; zbMATH DE number 97759
• scientific article; zbMATH DE number 4031386

Cited in

(3)

• The secretary problem for a random walk
• Foremost non-stop journey arrival in linear time
• Incentivizing hidden types in secretary problem

This page was built for publication: A Best-Choice Problem With Linear Travel Cost

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