Fetching the paper…
Reading the bibliography…
Prophet inequalities consist of many beautiful statements that establish tight performance ratios between online and offline allocation algorithms.
Krengel U, Sucheston L (1978) On semiamarts, amarts, and processes with finite value. Probability on Banach spaces 4:197–266
1978
Earlier work this paper cites.
Hill TP, Kertz RP (1982) Comparisons of stop rule and supremum expectations of iid random variables. The Annals of Probability 336–345
1982
Earlier work this paper cites.
Samuel-Cahn E (1984) Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability 1213–1216
1984
Earlier work this paper cites.
Kertz RP (1986) Stop rule and supremum expectations of iid random variables: a complete comparison by conjugate duality. Journal of multivariate analysis 19(1):88–112
1986
Earlier work this paper cites.
De Farias DP, Van Roy B (2003) The linear programming approach to approximate dynamic programming. Operations research 51(6):850–865
2003
Earlier work this paper cites.
Adelman D (2007) Dynamic bid prices in revenue management. Operations Research 55(4):647–661
2007
Earlier work this paper cites.
2007
Earlier work this paper cites.
Hajiaghayi MT, Kleinberg R, Sandholm T (2007) Automated online mechanism design and prophet inequalities. AAAI , volume 7, 58–65
2007
Earlier work this paper cites.
Shapiro A (2009) Semi-infinite programming, duality, discretization and optimality conditions. Optimization 58(2):133–161
2009
Earlier work this paper cites.
Topkis DM (2011) Supermodularity and complementarity. Supermodularity and Complementarity (Princeton university press)
2011
Earlier work this paper cites.
Yan Q (2011) Mechanism design via correlation gap. Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms , 710–719 (SIAM)
2011
Earlier work this paper cites.
Alaei S, Hajiaghayi M, Liaghat V (2012) Online prophet-inequality matching with applications to ad allocation. Proceedings of the 13th ACM Conference on Electronic Commerce , 18–35
2012
Earlier work this paper cites.
Kleinberg R, Weinberg SM (2012) Matroid prophet inequalities. Proceedings of the forty-fourth annual ACM symposium on Theory of computing , 123–136
2012
Earlier work this paper cites.
Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM Journal on Computing 43(2):930–972
2014
Cited alongside, same era.
Buchbinder N, Jain K, Singh M (2014) Secretary problems via linear programming. Mathematics of Operations Research 39(1):190–206
2014
Cited alongside, same era.
2015
Cited alongside, same era.
Harremoës P (2016) Bounds on tail probabilities for negative binomial distributions. Kybernetika 52(6):943–966
2016
Cited alongside, same era.
Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2017) Posted price mechanisms for a random stream of customers. Proceedings of the 2017 ACM Conference on Economics and Computation , 169–186
Feldman M, Svensson O, Zenklusen R (2021) Online contention resolution schemes with applications to bayesian selection problems. SIAM Journal on Computing 50(2):255–300
2021
Later among the works it cites.
Liu A, Leme RP, Pál M, Schneider J, Sivan B (2021) Variable decomposition for prophet inequalities and optimal ordering. Proceedings of the 22nd ACM Conference on Economics and Computation , 692–692
2021
Later among the works it cites.
Ma W, Simchi-Levi D, Zhao J (2021) Dynamic pricing (and assortment) under a static calendar. Management Science 67(4):2292–2313
2021
Later among the works it cites.
Papadimitriou C, Pollner T, Saberi A, Wajc D (2021) Online stochastic max-weight bipartite matching: Beyond prophet inequalities. Proceedings of the 22nd ACM Conference on Economics and Computation , 763–764
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
Ehsani S, Hajiaghayi M, Kesselheim T, Singla S (2018) Prophet secretary for combinatorial auctions and matroids. Proceedings of the twenty-ninth annual acm-siam symposium on discrete algorithms , 700–714 (SIAM)
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260
2019
Cited alongside, same era.
Chen Y, Farias VF, Trichakis N (2019) On the efficacy of static prices for revenue management in the face of strategic customers. Management Science 65(12):5535–5555
2019
Cited alongside, same era.
Correa J, Foncea P, Hoeksma R, Oosterwijk T, Vredeveld T (2019) Recent developments in prophet inequalities. ACM SIGecom Exchanges 17(1):61–70
2019
Cited alongside, same era.
Beyhaghi H, Golrezaei N, Leme RP, Pál M, Sivan B (2021) Improved revenue bounds for posted-price and second-price mechanisms. Operations Research 69(6):1805–1822
2021
Cited alongside, same era.
Correa J, Saona R, Ziliotto B (2021) Prophet secretary through blind strategies. Mathematical Programming 190(1):483–521
2021
Cited alongside, same era.
Arnosti N, Ma W (2022) Tight guarantees for static threshold policies in the prophet secretary problem. Proceedings of the 23rd ACM Conference on Economics and Computation , 242–242
2022
Closest in time.
Ezra T, Feldman M, Gravin N, Tang ZG (2022) Prophet matching with general arrivals. Mathematics of Operations Research 47(2):878–898
2022
Closest in time.
Fu H, Lu P, Tang ZG, Turkieltaub A, Wu H, Wu J, Zhang Q (2022) Oblivious online contention resolution schemes. Symposium on Simplicity in Algorithms (SOSA) , 268–278 (SIAM)
2022
Closest in time.
Jiang J, Ma W, Zhang J (2022) Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 1221–1246 (SIAM)
2022
Closest in time.
2022
Closest in time.
2024
Closest in time.
Jiang J, Li X, Zhang J (2025) Online stochastic optimization with wasserstein-based nonstationarity. Management Science
2025
Closest in time.