Pages that link to "Item:Q3000391"
From MaRDI portal
The following pages link to APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM (Q3000391):
Displaying 14 items.
- Dynamic programming and the secretary problem (Q918875) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- Progressive stopping heuristics that excel in individual and competitive sequential search (Q2112306) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- Secretary Problems via Linear Programming (Q3569816) (← links)
- (Q3771953) (← links)
- A generalization of the classical secretary problem: dependent arrival sequences (Q3792103) (← links)
- (Q3830835) (← links)
- (Q4294400) (← links)
- (Q4726074) (← links)
- Optimal Stopping of a Random Sequence with Unknown Distribution (Q5076690) (← links)
- Secretary Problems via Linear Programming (Q5169698) (← links)
- (Q5875579) (← links)
- Robust Algorithms for the Secretary Problem (Q5875730) (← links)