The following pages link to (Q2921721):
Displayed 9 items.
- Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
- Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
- Optimal algorithms for \(k\)-search with application in option pricing (Q834594) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- Model Predictive Control for Dynamic Resource Allocation (Q2925344) (← links)
- A Dynamic Near-Optimal Algorithm for Online Linear Programming (Q2931707) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)