Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
Published Online:18 Nov 2024https://doi.org/10.1287/opre.2022.0504
- Cited by
- 17 February 2026 | Operations Research, Vol. 74, No. 3
- 26 February 2026 | Operations Research, Vol. 74, No. 3
- 18 November 2025 | Operations Research, Vol. 74, No. 2
Volume 73, Issue 3
May-June 2025
Pages iii-viii, 1151-1722, C2-C3
Article Information
Supplemental Material
Metrics
Information
- Received:September 23, 2022
- Accepted:January 11, 2024
- Published Online:November 18, 2024
Copyright © 2024, INFORMS
Cite as
Omar Besbes, Yash Kanoria, Akshit Kumar (2024) Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances. Operations Research 73(3):1273-1288.
https://doi.org/10.1287/opre.2022.0504
Keywords
The authors thank the reviewers, associate editor, and area chair for thought-provoking comments that greatly improved the paper. An earlier version of this paper appeared as an extended abstract in the Proceedings of the 23rd ACM Conference on Economics and Computation with the title “The Multisecretary Problem with Many Types.”
