Pages that link to "Item:Q1140921"
From MaRDI portal
The following pages link to On an optimal stopping problem of Gusein-Zade (Q1140921):
Displaying 15 items.
- Choosing either the best or the second best when the number of applicants is random (Q597360) (← links)
- Optimal stopping in a search for a vertex with full degree in a random graph (Q765377) (← links)
- Expected duration of the no-information minimum rank problem (Q826693) (← links)
- On a class of best-choice problems (Q1087455) (← links)
- On optimal choosing of one of the \(k\) best objects. (Q1423065) (← links)
- Gusein-Zade problem for directed path (Q1952502) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- A new method for computing asymptotic results in optimal stopping problems (Q2105922) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- A generalized secretary problem (Q2816630) (← links)
- APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM (Q3000391) (← links)
- Objectives in the Best-Choice Problems (Q4681136) (← links)
- Sum the Multiplicative Odds to One and Stop (Q4933198) (← links)
- Optimal Stopping of a Random Sequence with Unknown Distribution (Q5076690) (← links)
- A Full-Information Best-Choice Problem with Allowance (Q5485354) (← links)