Beyond matroids: secretary problem and prophet inequality with general constraints
From MaRDI portal
Publication:5361840
DOI10.1145/2897518.2897540zbMath1373.68457arXiv1604.00357OpenAlexW2329590824MaRDI QIDQ5361840
Publication date: 29 September 2017
Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.00357
Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27)
Related Items (17)
The secretary recommendation problem ⋮ Finding the second-best candidate under the Mallows model ⋮ Prophet Matching with General Arrivals ⋮ Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ Prophet inequalities vs. approximating optimum online ⋮ Packing returning secretaries ⋮ Hiring Secretaries over Time: The Benefit of Concurrent Employment ⋮ Optimal prophet inequality with less than one sample ⋮ Unnamed Item ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Stable secretaries ⋮ Unnamed Item ⋮ From pricing to prophets, and back! ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
This page was built for publication: Beyond matroids: secretary problem and prophet inequality with general constraints
