Combinatorial Prophet Inequalities
From MaRDI portal
Publication:4575853
DOI10.1137/1.9781611974782.110zbMath1417.91251arXiv1611.00665OpenAlexW2950198148MaRDI QIDQ4575853
Aviad Rubinstein, Sahil Singla
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.00665
secretary problemprophet inequalitiescombinatorial valuation functionsmonotone subadditive objective function
Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40) Auctions, bargaining, bidding and selling, and other market models (91B26)
Related Items (17)
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution ⋮ On the correlation gap of matroids ⋮ Streaming adaptive submodular maximization ⋮ Hiring Secretaries over Time: The Benefit of Concurrent Employment ⋮ Unnamed Item ⋮ Making individually fair predictions with causal pathways ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Improved prophet inequalities for combinatorial welfare maximization with (approximately) subadditive agents ⋮ Streaming adaptive submodular maximization ⋮ Stochastic submodular probing with state-dependent costs ⋮ Stochastic submodular probing with state-dependent costs ⋮ 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: Combinatorial Prophet Inequalities
