The following pages link to (Q4633940):
Displaying 10 items.
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Optimal algorithms for the online time series search problem (Q621833) (← links)
- Online algorithms for the multiple time series search problem (Q1762061) (← links)
- Secretary markets with local information (Q2010597) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Worst-Case Mechanism Design via Bayesian Analysis (Q4978196) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
- Secretary and online matching problems with machine learned advice (Q6108930) (← links)
