Matroid secretary problem in the random assignment model
From MaRDI portal
Recommendations
Cited in
(18)- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- The best-or-worst and the postdoc problems
- Prior independent mechanisms via prophet inequalities with limited information
- Online matroid intersection: beating half for random arrival
- A new look at the returning secretary problem
- Matroid secretary problem in the random-assignment model
- Matroids, secretary problems, and online mechanisms
- Strong algorithms for the ordinal matroid secretary problem
- Matroid Secretary Problems
- Advances on matroid secretary problems: free order model and laminar case
- A Framework for the Secretary Problem on the Intersection of Matroids
- The matroid secretary problem for minor-closed classes and random matroids
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- Improved competitive ratio for the matroid secretary problem
- Query-based selection of optimal candidates under the Mallows model
- Constant-competitiveness for random assignment matroid secretary without knowing the matroid
This page was built for publication: Matroid secretary problem in the random assignment model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365116)
