An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object

DOI10.1239/JAP/1143936245MaRDI QIDQ5488991zbMATH OpenOpenAlexFDO

Authors Mitsushi Tamaki, Vladimir V. Mazalov

Publication date 25 September 2006

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

Full work available at URL https://projecteuclid.org/euclid.jap/1143936245

zbMATH Keywords

optimal stoppingsecretary problemmonotone subsequence problemplanar Poisson processduration problem\(e^{-1}\)-law

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• scientific article; zbMATH DE number 67283
• Optimal stopping rule for the no-information duration problem with random horizon
• scientific article; zbMATH DE number 4031386
• scientific article; zbMATH DE number 1239843
• scientific article; zbMATH DE number 4033475

Cites work

• scientific article; zbMATH DE number 67283 (Why is no real title available?)
• scientific article; zbMATH DE number 67284 (Why is no real title available?)
• A Secretary Problem with Finite Memory
• A full-information best-choice problem with finite memory
• A unified approach to a class of best choice problems with an unknown number of options
• Best choice from the planar Poisson process
• Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation
• Infinitesimal Look-Ahead Stopping Rules
• Objectives in the Best-Choice Problems
• On a best choice problem with partial information
• On best choice problems having similar solutions
• On the full information best-choice problem
• Optimal rules for the sequential selection of monotone subsequences of maximum expected length
• Recognizing the maximum of a random sequence based on relative rank with backward solicitation
• The Best Choice Problem for a Random Number of Objects
• The full-information best choice problem with a random number of observations
• The infinite secretary problem with recall
• Why do these quite different best-choice problems have the same solutions?

Cited in

(9)

• The infinite secretary problem with recall
• Winning Rate in the Full-Information Best-Choice Problem
• On the optimal stopping problems with monotone thresholds
• Optimal stopping rule for the full-information duration problem with random horizon
• The odds algorithm based on sequential updating and its performance
• Shelf life of candidates in the generalized secretary problem
• On a duration problem with unbounded geometrical horizon
• scientific article; zbMATH DE number 67283 (Why is no real title available?)
• Optimal stopping rule for the no-information duration problem with random horizon

This page was built for publication: An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5488991)