Strong algorithms for the ordinal matroid secretary problem

zbMATH Open1403.68387arXiv1802.01997MaRDI QIDQ4607929FDOQ4607929

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

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

Mathematics Subject Classification ID

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 (11)

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

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)