Beating 1-1/e for ordered prophets
From MaRDI portal
Publication:4977961
DOI10.1145/3055399.3055479zbMath1369.68349arXiv1704.05836OpenAlexW2607706733MaRDI QIDQ4977961
Melika Abolhassani, Brendan Lucier, Hossein Esfandiari, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Robert D. Kleinberg
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.05836
Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)
Related Items (7)
Prophet Inequalities for Independent and Identically Distributed Random Variables from an Unknown Distribution ⋮ Prophet inequalities vs. approximating optimum online ⋮ Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents ⋮ Tight Revenue Gaps Among Simple Mechanisms ⋮ Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs ⋮ Prophet secretary through blind strategies ⋮ Posted Price Mechanisms and Optimal Threshold Strategies for Random Arrivals
This page was built for publication: Beating 1-1/e for ordered prophets
