Strong algorithms for the ordinal matroid secretary problem

MaRDI QIDQ4607929zbMATH OpenFDO

Authors José A. Soto, Abner Turkieltaub, Víctor Verdugo

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1802.01997, http://dl.acm.org/citation.cfm?id=3175317

Mathematics Subject Classification ID

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

Recommendations

• Strong algorithms for the ordinal matroid secretary problem
• Improved competitive ratio for the matroid secretary problem
• Matroid secretary problem in the random-assignment model
• Matroid secretary problem in the random assignment model
• Matroid Secretary Problems

Cited in

(12)

• Partial-order analogue of the secretary problem: The binary tree case
• Secretary problem: graphs, matroids and greedoids
• Formal barriers to simple algorithms for the matroid secretary problem
• Strong algorithms for the ordinal matroid secretary problem
• A Framework for the Secretary Problem on the Intersection of Matroids
• Packing returning secretaries
• Combinatorial secretary problems with ordinal information
• The matroid secretary problem for minor-closed classes and random matroids
• Robust Algorithms for the Secretary Problem
• Packing returning secretaries
• Secretary and online matching problems with machine learned advice
• Beating competitive ratio 4 for graphic matroid secretary

This page was built for publication: Strong algorithms for the ordinal matroid secretary problem

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