The following pages link to (Q4011991):
Displaying 18 items.
- Multi-criteria optimal stopping methods applied to the portfolio optimisation problem (Q1615933) (← links)
- Shelf life of candidates in the generalized secretary problem (Q1694784) (← links)
- On a duration problem with unbounded geometrical horizon (Q1728264) (← links)
- The best-or-worst and the postdoc problems (Q1743480) (← links)
- A new method for computing asymptotic results in optimal stopping problems (Q2105922) (← links)
- The multi-returning secretary problem (Q2166212) (← links)
- An extension of the last-success-problem (Q2288748) (← links)
- A new look at the returning secretary problem (Q2424722) (← links)
- Best choice from the planar Poisson process (Q2485763) (← links)
- On the optimal stopping problems with monotone thresholds (Q2794716) (← links)
- Optimal stopping rule for the full-information duration problem with random horizon (Q2806344) (← links)
- The odds algorithm based on sequential updating and its performance (Q3625649) (← links)
- Adaptive approach to some stopping problems (Q3697988) (← links)
- (Q4225599) (← links)
- Why do these quite different best-choice problems have the same solutions? (Q4819488) (← links)
- Maximizing the Expected Duration of Owning a Relatively Best Object in a Poisson Process with Rankable Observations (Q5321758) (← links)
- Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon (Q5396590) (← links)
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991) (← links)
