A framework for the secretary problem on the intersection of matroids

zbMATH Open1403.68381arXiv1704.02608MaRDI QIDQ4607930FDOQ4607930

Authors: Moran Feldman, Ola Svensson, Rico Zenklusen 

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1704.02608

Recommendations

• A Framework for the Secretary Problem on the Intersection of Matroids
• Matroid Secretary Problems
• Matroids, secretary problems, and online mechanisms
• Submodular secretary problem and extensions
• Submodular secretary problem and extensions

zbMATH Keywords

online algorithmsmatroid intersectionmatroid secretary problem

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Combinatorial aspects of matroids and geometric lattices (05B35) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Cited In (8)

• Strong algorithms for the ordinal matroid secretary problem
• A Framework for the Secretary Problem on the Intersection of Matroids
• Online contention resolution schemes with applications to Bayesian selection problems
• Matroid Secretary Problems
• Formal barriers to simple algorithms for the matroid secretary problem
• New results for the \(k\)-secretary problem
• Prior independent mechanisms via prophet inequalities with limited information
• Online algorithms for the maximum \(k\)-interval coverage problem

This page was built for publication: A framework for the secretary problem on the intersection of matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607930)