The secretary problem for a random walk

DOI10.1016/0304-4149(88)90104-4zbMath0647.60051OpenAlexW1987722503MaRDI QIDQ1104634

J. N. Sheahan, Myron Hlynka

Publication date: 1988

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(88)90104-4

zbMATH Keywords

stopping rulessecretary problempicking the maximum of a sequence

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (6)

Predicting the Supremum: Optimality of ‘Stop at Once or Not at All’ ⋮ Dynamic programming formulation of the group interview problem with a general utility function ⋮ Two Rationales Behind the ‘Buy-And-Hold or Sell-At-Once’ Strategy ⋮ A General ‘Bang-Bang’ Principle for Predicting the Maximum of a Random Walk ⋮ Selecting the best choice in the weighted secretary problem ⋮ Rank-based selection strategies for the random walk process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Secretary Problem and Its Extensions: A Review
• A Best-Choice Problem With Linear Travel Cost
• A Generalized Problem of Optimal Selection and Assignment

This page was built for publication: The secretary problem for a random walk