Pages that link to "Item:Q2485763"
From MaRDI portal
The following pages link to Best choice from the planar Poisson process (Q2485763):
Displaying 15 items.
- Stochastic processes with proportional increments and the last-arrival problem (Q444355) (← links)
- Shelf life of candidates in the generalized secretary problem (Q1694784) (← 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)
- Objectives in the Best-Choice Problems (Q4681136) (← 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)
- What is Known About Robbins' Problem? (Q5312844) (← links)
- Optimal Stopping Rule for the No-Information Duration Problem with Random Horizon (Q5396590) (← 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)
