Competitive analysis with a sample and the secretary problem
From MaRDI portal
Cites work
- A Knapsack Secretary Problem with Applications
- A multiple-choice secretary algorithm with applications to online auctions
- An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
- Applications of Ramsey's theorem to decision tree complexity
- Comparisons of stop rule and supremum expectations of i.i.d. random variables
- Competitive Analysis with a Sample and the Secretary Problem
- Dynamic Programming and Decision Theory
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- scientific article; zbMATH DE number 7650408 (Why is no real title available?)
- scientific article; zbMATH DE number 7788460 (Why is no real title available?)
- Learn from history for online bipartite matching
- Matroids, secretary problems, and online mechanisms
- Online independent set beyond the worst-case: secretaries, prophets, and periods
- Online matching and ad allocation
- Online weighted matching with a sample
- Prophet Inequalities with Limited Information
- Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality
- Secretary Problems via Linear Programming
- Secretary Problems with Non-Uniform Arrival Order
- Stop rule and supremum expectations of i.i.d. random variables: A complete comparison by conjugate duality
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 Q6881680)
