Recognizing the maximum of a random sequence based on relative rank with backward solicitation
From MaRDI portal
Publication:4118583
DOI10.2307/3212694zbMath0348.60064OpenAlexW2050103797MaRDI QIDQ4118583
Publication date: 1974
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212694
Related Items (10)
A secretary problem on fuzzy sets ⋮ Unnamed Item ⋮ The secretary problem as a model of choice ⋮ An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation. ⋮ The best choice problem for a union of two linear orders with common maximum ⋮ A Secretary Problem with Many Lives ⋮ Rank-based selection strategies for the random walk process ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object ⋮ Partial-order analogue of the secretary problem: The binary tree case ⋮ The secretary problem with a call option
This page was built for publication: Recognizing the maximum of a random sequence based on relative rank with backward solicitation
