Prophet Inequalities with Limited Information

DOI10.1137/1.9781611973402.100zbMath1422.91162arXiv1307.3736OpenAlexW2951504504MaRDI QIDQ5384062

S. Matthew Weinberg, Pablo D. Azar, Robert D. Kleinberg

Publication date: 20 June 2019

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

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

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (20)

Prophet Secretary ⋮ Formal barriers to simple algorithms for the matroid secretary problem ⋮ Online network design with outliers ⋮ 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 ⋮ Bayesian auctions with efficient queries ⋮ Prophet inequalities vs. approximating optimum online ⋮ Secretary and online matching problems with machine learned advice ⋮ Performance bounds for optimal sales mechanisms beyond the monotone hazard rate condition ⋮ Optimal prophet inequality with less than one sample ⋮ The Submodular Secretary Problem Goes Linear ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Prophet secretary through blind strategies ⋮ From pricing to prophets, and back! ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Robust Auctions for Revenue via Enhanced Competition ⋮ On Policies for Single-Leg Revenue Management with Limited Demand Information ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Budget-Feasible Mechanism Design for Non-monotone Submodular Objectives: Offline and Online

This page was built for publication: Prophet Inequalities with Limited Information