The following pages link to (Q2934624):
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)
- Online \((J, K)\)-search problem and its competitive analysis (Q501005) (← links)
- Laminar matroids (Q518194) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- Near optimal algorithms for online weighted bipartite matching in adversary model (Q1680479) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
- The best-or-worst and the postdoc problems (Q1743480) (← links)
- On the on-line maintenance scheduling problem (Q1744635) (← links)
- Stable secretaries (Q1999964) (← links)
- Secretary markets with local information (Q2010597) (← links)
- On variants of the matroid secretary problem (Q2017872) (← links)
- Prophet secretary for \(k\)-knapsack and \(l\)-matroid intersection via continuous exchange property (Q2115881) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
- From pricing to prophets, and back! (Q2294260) (← links)
- Generalized laminar matroids (Q2422233) (← links)
- A new look at the returning secretary problem (Q2424722) (← links)
- The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← 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)
- 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)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) (Q3088096) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- Polymatroid Prophet Inequalities (Q3452806) (← links)
- Prophet Secretary (Q3452813) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Sequential Posted Price Mechanisms with Correlated Valuations (Q3460773) (← 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)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- (Q5091060) (← links)
- Tight Revenue Gaps Among Simple Mechanisms (Q5123985) (← 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)
- Matroidal Choice Functions (Q5234660) (← links)
- Prophet Secretary (Q5348218) (← links)
- Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays (Q5364222) (← links)
- (Q5743511) (← links)
- Online Contention Resolution Schemes with Applications to Bayesian Selection Problems (Q5856151) (← links)
