Pages that link to "Item:Q4716093"
From MaRDI portal
The following pages link to On the full information best-choice problem (Q4716093):
Displaying 18 items.
- On approximative solutions of multistopping problems (Q655588) (← links)
- An interactive method for the optimal selection problem with two decision makers (Q704098) (← links)
- Multi-criteria optimal stopping methods applied to the portfolio optimisation problem (Q1615933) (← links)
- Iterated full information secretary problem (Q1683938) (← links)
- Approximation of optimal stopping problems. (Q1879497) (← links)
- Full-information best choice game with hint (Q2009175) (← links)
- Best choice from the planar Poisson process (Q2485763) (← links)
- Running minimum in the best-choice problem (Q2688195) (← 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)
- Optimal Choice of the Best Available Applicant in Full-Information Models (Q3402060) (← links)
- Recognising the last record of sequence (Q3429340) (← links)
- A new strategy for Robbins’ problem of optimal stopping (Q4684856) (← links)
- Why do these quite different best-choice problems have the same solutions? (Q4819488) (← links)
- Sum the Multiplicative Odds to One and Stop (Q4933198) (← links)
- Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem (Q5421580) (← links)
- Winning Rate in the Full-Information Best-Choice Problem (Q5443752) (← links)
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object (Q5488991) (← links)
