Published Online:29 Dec 2022https://doi.org/10.1287/opre.2022.2419
- Cited by
- 22 June 2026 | Operations Research, Vol. 0, No. 0
- 17 April 2025 | Mathematics of Operations Research, Vol. 51, No. 2
- 26 February 2026 | Operations Research, Vol. 74, No. 3
- 25 March 2025 | Mathematics of Operations Research, Vol. 51, No. 1
- 9 September 2025 | Manufacturing & Service Operations Management, Vol. 28, No. 1
- 11 March 2025 | Management Science, Vol. 71, No. 11
- 17 October 2025 | Management Science, Vol. 0, No. 0
- 25 November 2024 | Operations Research, Vol. 73, No. 3
- Jiashuo Jiang; ,
- Will Ma; ,
- Jiawei Zhang
3 June 2024 | Operations Research, Vol. 73, No. 3- 3 June 2024 | Algorithms, Vol. 17, No. 6
- 1 January 2024 | SSRN Electronic Journal, Vol. 69
- 1 January 2023 | SSRN Electronic Journal, Vol. 64
- SSRN Electronic Journal, Vol. 71

Volume 71, Issue 5
September-October 2023
Pages iii-vii, 1441-1924, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:August 04, 2021
- Accepted:November 23, 2022
- Published Online:December 29, 2022
Copyright © 2022, INFORMS
Cite as
Nick Arnosti, Will Ma (2022) Tight Guarantees for Static Threshold Policies in the Prophet Secretary Problem. Operations Research 71(5):1777-1788.
https://doi.org/10.1287/opre.2022.2419
Keywords
A one-page abstract of this article is in Arnosti and Ma (2022).
