Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards
Published Online:12 Jun 2020https://doi.org/10.1287/stsy.2019.0055
- Cited by
- 3 March 2025 | Management Science, Vol. 71, No. 11
- 25 February 2025 | Operations Research, Vol. 73, No. 6
- 17 July 2024 | Operations Research, Vol. 73, No. 4
- 23 September 2024 | Management Science, Vol. 71, No. 6
- 18 November 2024 | Operations Research, Vol. 73, No. 3
- 1 January 2025 | SSRN Electronic Journal, Vol. 62
- 9 May 2023 | Operations Research, Vol. 72, No. 5
- 1 January 2024 | SSRN Electronic Journal, Vol. 262
- 14 September 2022 | Mathematics of Operations Research, Vol. 48, No. 3
- 26 July 2021 | Acta Applicandae Mathematicae, Vol. 174, No. 1
- SSRN Electronic Journal, Vol. 55
Volume 10, Issue 2
June 2020
Pages 99-191
Article Information
Metrics
Information
- Received:September 06, 2018
- Accepted:November 07, 2019
- Published Online:June 12, 2020
Copyright © 2020, The Author(s)
Cite as
Alessandro Arlotto, Xinchang Xie (2020) Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards. Stochastic Systems 10(2):170-191.
https://doi.org/10.1287/stsy.2019.0055
Keywords
