Combinatorial secretary problems with ordinal information

DOI10.4230/LIPICS.ICALP.2017.133zbMATH Open1442.68277arXiv1702.01290MaRDI QIDQ5111465FDOQ5111465

Martin Hoefer, Bojana Kodric

Publication date: 27 May 2020

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

Recommendations

• Strong algorithms for the ordinal matroid secretary problem
• Strong algorithms for the ordinal matroid secretary problem
• Matroid Secretary Problems
• Matroids, secretary problems, and online mechanisms
• Submodular secretary problems: cardinality, matching, and linear constraints

zbMATH Keywords

online algorithmssecretary problemordinal informationmatroid secretary

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Decision theory (91B06) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (9)

• Title not available (Why is that?)
• Secretary markets with local information
• Formal barriers to simple algorithms for the matroid secretary problem
• The secretary recommendation problem
• New results for the \(k\)-secretary problem
• Packing returning secretaries
• Strong Algorithms for the Ordinal Matroid Secretary Problem
• Knapsack secretary through boosting
• Ordinal approximation for social choice, matching, and facility location problems given candidate positions

This page was built for publication: Combinatorial secretary problems with ordinal information

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