Competitive Analysis with a Sample and the Secretary Problem

DOI10.1137/1.9781611975994.128MaRDI QIDQ5146915zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, David Naori, Danny Raz

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(10)

• Learn from history for online bipartite matching
• Online generalized assignment problem with historical information
• Online crowdsourced truck delivery using historical information
• Prophet inequalities for independent and identically distributed random variables from an unknown distribution
• Secretary and online matching problems with machine learned advice
• Optimal prophet inequality with less than one sample
• Order-competitive ratio
• Competitive analysis with a sample and the secretary problem
• Competitive secretary problem
• The last success problem with samples

This page was built for publication: Competitive Analysis with a Sample and the Secretary Problem

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