scientific article

zbMath0745.62079MaRDI QIDQ4011991

No author found.

Publication date: 27 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

discount factorsecretary problemPascal processesbest-choice duration modelno-information caserecalls of preceding observationsrelative best rankrandom arrivalcompound Poisson processes with exponential ratefull-information modelsrandom option arrival processes

Mathematics Subject Classification ID

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

Related Items (18)

Adaptive approach to some stopping problems ⋮ Multi-criteria optimal stopping methods applied to the portfolio optimisation problem ⋮ Why do these quite different best-choice problems have the same solutions? ⋮ The multi-returning secretary problem ⋮ Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations ⋮ A new look at the returning secretary problem ⋮ Shelf life of candidates in the generalized secretary problem ⋮ On a duration problem with unbounded geometrical horizon ⋮ Unnamed Item ⋮ Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon ⋮ The best-or-worst and the postdoc problems ⋮ Best choice from the planar Poisson process ⋮ On the optimal stopping problems with monotone thresholds ⋮ An extension of the last-success-problem ⋮ Optimal stopping rule for the full-information duration problem with random horizon ⋮ The odds algorithm based on sequential updating and its performance ⋮ An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object ⋮ A new method for computing asymptotic results in optimal stopping problems

This page was built for publication: