Sequential Search Beats Best-of-NSearch

DOI10.1080/07474946.2013.774614zbMath1267.60044OpenAlexW2053097452MaRDI QIDQ4924126

Raymond Cheng

Publication date: 30 May 2013

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

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

zbMATH Keywords

sequential searchreservation wagebest-of-\(N\) searchfixed-length search

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Economics of information (91B44) Mathematical biology in general (92B99)

Related Items (2)

An elementary approach to optimal discrete-time search strategies ⋮ Sequential Search Beats a Two-Parameter Search

Cites Work

• Optimal Sequential Selection of a Unimodal Subsequence of a Random Sequence
• Integration by Parts for Stieltjes Integrals
• A continuous-time job search model: general renewal processes

This page was built for publication: Sequential Search Beats Best-of-NSearch