Published Online:3 Jun 2024https://doi.org/10.1287/opre.2022.0309
- Cited by
- 26 February 2026 | Operations Research, Vol. 74, No. 3
- 8 April 2025 | Management Science, Vol. 71, No. 12
- 17 October 2025 | Management Science, Vol. 0, No. 0
- 29 August 2024 | Mathematics of Operations Research, Vol. 50, No. 3

Volume 73, Issue 3
May-June 2025
Pages iii-viii, 1151-1722, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:June 13, 2022
- Accepted:April 09, 2024
- Published Online:June 03, 2024
Copyright © 2024, INFORMS
Cite as
Jiashuo Jiang; , Will Ma; , Jiawei Zhang (2024) Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack. Operations Research 73(3):1703-1721.
https://doi.org/10.1287/opre.2022.0309
Keywords
The authors thank two anonymous reviewers, an associate editor, and Daniel Kuhn, the area editor, for constructive comments that greatly improved the exposition of the paper and one of the reviewers for the suggestion that led to a new proof of Theorem 1 and Theorem 4. A preliminary version of the paper appeared in ACM-SIAM Symposium on Discrete Algorithms (SODA22) 2022.
