Robust Algorithms for the Secretary Problem

DOI10.4230/LIPICS.ITCS.2020.32MaRDI QIDQ5875730zbMATH OpenOpenAlexFDO

Authors Domagoj Bradač, Anupam Gupta, Sahil Singla, Goran Zuzic

Publication date 3 February 2023

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

zbMATH Keywords

matroid secretaryrobust optimizationrobust secretarysecretary problemstochastic optimization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Improved algorithms and analysis for secretary problems and generalizations
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• The Secretary Problem and Its Extensions: A Review
• The Secretary Problem with Optimal Assignment
• Strong algorithms for the ordinal matroid secretary problem
• Strong algorithms for the ordinal matroid secretary problem
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• Dynamic programming and the secretary problem
• Formal barriers to simple algorithms for the matroid secretary problem

Cited in

(3)

• Secretary and online matching problems with machine learned advice
• Knapsack secretary with bursty adversary
• Robust algorithms under adversarial injections

This page was built for publication: Robust Algorithms for the Secretary Problem

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