Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations

References

• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
• Arlotto A, Xie X (2020) Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards. Stochastic Systems 10(2):170–191.Link, Google Scholar
• Balseiro SR, Besbes O, Pizarro D (2023) Survey of dynamic resource-constrained reward collection problems: Unified model and analysis. Oper. Res., ePub ahead of print May 9, https://doi.org/10.1287/opre.2023.2441.Link, Google Scholar
• Besbes O, Kanoria Y, Kumar A (2023) Dynamic resource allocation: Algorithmic design principles and spectrum of achievable performances. Preprint, submitted October 6, https://arxiv.org/abs/2205.09078.Google Scholar
• Caley A (1875) Mathematical questions with their solutions. Edu. Times 23:18–19.Google Scholar
• Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.Link, Google Scholar
• Jiang J, Zhang J (2020) Online resource allocation with stochastic resource consumption. Preprint, submitted December 14, https://arxiv.org/abs/2012.07933.Google Scholar
• Jiang J, Ma W, Zhang J (2024) Degeneracy is OK: Logarithmic regret for network revenue management with indiscrete distributions. Preprint, submitted February 8, https://arxiv.org/abs/2210.07996.Google Scholar
• Li X, Ye Y (2022) Online linear programming: Dual convergence, new algorithms, and regret bounds. Oper. Res. 70(5):2948–2966.Link, Google Scholar
• Lueker GS (1998) Average-case analysis of off-line and on-line knapsack problems. J. Algorithms 29:277–305.Crossref, Google Scholar
• Vera A, Banerjee S (2019) The Bayesian prophet: A low-regret framework for online decision making. Working paper, Cornell University, Ithaca, NY.Google Scholar
• Vera A, Banerjee S, Gurvich I (2019) Online allocation and pricing: Constant regret via bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Wang Y, Wang H (2022) Constant regret resolving heuristics for price-based revenue management. Oper. Res. 5463(3):1–20.Google Scholar