Pages that link to "Item:Q2017872"

The following pages link to On variants of the matroid secretary problem (Q2017872):

Displaying 12 items.

• The simulated greedy algorithm for several submodular matroid secretary problems (Q290918) (← links)
• Online \((J, K)\)-search problem and its competitive analysis (Q501005) (← links)
• Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
• Matroid prophet inequalities and applications to multi-dimensional mechanism design (Q1735736) (← links)
• Prior independent mechanisms via prophet inequalities with limited information (Q2278945) (← links)
• The best-or-worst and the postdoc problems with random number of candidates (Q2424796) (← links)
• Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
• (Q3092242) (redirect page) (← links)
• Strong Algorithms for the Ordinal Matroid Secretary Problem (Q5000649) (← links)
• A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
• Generalized Sequential Stochastic Assignment Problem (Q5113887) (← links)
• A Simple <i>O</i>(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem (Q5219558) (← links)