An elementary approach to optimal discrete-time search strategies

DOI10.1080/07474946.2017.1394721zbMath1398.60061OpenAlexW2792477480MaRDI QIDQ4603860

Raymond Cheng

Publication date: 19 February 2018

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07474946.2017.1394721

zbMATH Keywords

stopping timesequential searchbackward inductionreservation wage

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mate choice and optimal search behavior: fitness returns under the fixed sample and sequential search strategies
• Integration by Parts for Stieltjes Integrals
• Sale of a Deteriorating Asset via Sequential Search
• Sequential Search Beats Best-of-NSearch
• On vacuum negative refraction, the effective medium and Sylvester's Inertia Theorem: the resolution of a paradox
• Sequential Search Beats a Two-Parameter Search

This page was built for publication: An elementary approach to optimal discrete-time search strategies