Pages that link to "Item:Q2706186"
From MaRDI portal
The following pages link to Improved Algorithms and Analysis for Secretary Problems and Generalizations (Q2706186):
Displaying 15 items.
- Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
- Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks (Q455991) (← links)
- Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
- Delay-tolerant delivery of quality information in ad hoc networks (Q635374) (← links)
- Optimal algorithms for \(k\)-search with application in option pricing (Q834594) (← links)
- The solution of a generalized secretary problem via analytic expressions (Q2012898) (← links)
- A unified approach for solving sequential selection problems (Q2188431) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Prophet Secretary (Q3452813) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- (Q5090369) (← links)
- Prophet Secretary (Q5348218) (← links)
- Algorithms for maximum social welfare of online random trading (Q6558686) (← links)
