Minimizing the expected rank with full information

DOI10.2307/3214770zbMath0781.60035OpenAlexW2056020109MaRDI QIDQ4274453

Thomas S. Ferguson, F. Thomas Bruss

Publication date: 17 February 1994

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c4ac70fce0ac23d09e3816c4ff3fa9c4869fc7e4

zbMATH Keywords

optimal stoppingsecretary problem

Mathematics Subject Classification ID

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

Related Items (9)

Online network design with outliers ⋮ What is Known About Robbins' Problem? ⋮ Optimal rules for the sequential selection of uniform spacings ⋮ Strategic disclosure of random variables ⋮ Odds -theorem and monotonicity ⋮ An interactive method for the optimal selection problem with two decision makers ⋮ A new strategy for Robbins’ problem of optimal stopping ⋮ A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank ⋮ A Full-Information Best-Choice Problem with Allowance

This page was built for publication: Minimizing the expected rank with full information