The following pages link to (Q2921721):
Displaying 50 items.
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
- Online network design with outliers (Q334928) (← links)
- 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)
- Online \((J, K)\)-search problem and its competitive analysis (Q501005) (← links)
- Optimal algorithms for \(k\)-search with application in option pricing (Q834594) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Scheduling In the random-order model (Q1979454) (← links)
- Secretary markets with local information (Q2010597) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Improved online algorithms for Knapsack and GAP in the random order model (Q2032350) (← links)
- Secretary problem: graphs, matroids and greedoids (Q2068844) (← links)
- Improved online algorithm for fractional knapsack in the random order model (Q2085749) (← links)
- Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
- Monotone \(k\)-submodular secretary problems: cardinality and knapsack constraints (Q2140573) (← links)
- The secretary recommendation problem (Q2155898) (← links)
- Finding the second-best candidate under the Mallows model (Q2166728) (← links)
- Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
- Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
- Competitive weighted matching in transversal matroids (Q2428661) (← links)
- New results for the \(k\)-secretary problem (Q2658048) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- The secretary problem with reservation costs (Q2695326) (← links)
- Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
- Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← 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)
- Secretary Markets with Local Information (Q3449504) (← links)
- Prophet Secretary (Q3452813) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Primal Beats Dual on Online Packing LPs in the Random-Order Model (Q4554073) (← links)
- The Submodular Secretary Problem Goes Linear (Q4637502) (← links)
- Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
- Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints (Q5002619) (← links)
- (Q5002749) (← links)
- Online Resource Allocation Under Partially Predictable Demand (Q5003724) (← links)
- Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds (Q5058054) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- (Q5090369) (← links)
- Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
- Uniformly Bounded Regret in the Multisecretary Problem (Q5113899) (← links)
- Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards (Q5119417) (← links)
- The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids (Q5208744) (← links)
- A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)
- Prophet Secretary (Q5348218) (← links)
- (Q5743511) (← links)
