Pages that link to "Item:Q3558937"
From MaRDI portal
The following pages link to The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations (Q3558937):
Displaying 8 items.
- Expected duration of the no-information minimum rank problem (Q826693) (← links)
- Secretary problems as a source of benchmark bounds (Q1624524) (← links)
- Progressive stopping heuristics that excel in individual and competitive sequential search (Q2112306) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Optimal selection problems based on exchangeable trials (Q2564692) (← links)
- A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank (Q3621144) (← links)
- Sum the Multiplicative Odds to One and Stop (Q4933198) (← links)
- Optimal Online Selection of an Alternating Subsequence: A Central Limit Theorem (Q5169506) (← links)