Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances

Bray RL (2022) Logarithmic regret in multisecretary and online linear programming problems with continuous valuations. arXiv e-prints arXiv–1912

1912

Earlier work this paper cites.

Moser L (1956) On a problem of cayley. Scripta Math 22:289–292

1956

Earlier work this paper cites.

Kleywegt AJ, Papastavrou JD (1998) The dynamic and stochastic knapsack problem. Operations research 46(1):17–35

1998

Earlier work this paper cites.

Lueker GS (1998) Average-case analysis of off-line and on-line knapsack problems. Journal of Algorithms 29(2):277–305

1998

Earlier work this paper cites.

Talluri K, Van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management science 44(11-part-1):1577–1593

1998

Earlier work this paper cites.

Talluri K, Van Ryzin G (1999) A randomized linear programming method for computing network bid prices. Transportation science 33(2):207–216

1999

Earlier work this paper cites.

Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms , 630–631 (Citeseer)

2005

Earlier work this paper cites.

Talluri KT, Van Ryzin GJ (2006) The theory and practice of revenue management , volume 68 (Springer Science & Business Media)

2006

Earlier work this paper cites.

Chawla S, Devanur N, Lykouris T (2020) Static pricing for multi-unit prophet inequalities. arXiv preprint arXiv:2007.07990

Original

2007

Earlier work this paper cites.

Hajiaghayi MT, Kleinberg R, Sandholm T (2007) Automated online mechanism design and prophet inequalities. AAAI , volume 7, 58–65

2007

Earlier work this paper cites.

Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Mathematics of Operations Research 37(2):313–345

2012

Cited alongside, same era.

Kunnumkal S, Talluri K, Topaloglu H (2012) A randomized linear programming method for network revenue management with product-specific no-shows. Transportation Science 46(1):90–108

2012

Cited alongside, same era.

Alaei S (2014) Bayesian combinatorial auctions: Expanding single buyer mechanisms to many buyers. SIAM Journal on Computing 43(2):930–972

2014

Cited alongside, same era.

Besbes O, Sauré D (2014) Dynamic pricing strategies in the presence of demand shifts. Manufacturing & Service Operations Management 16(4):513–528

2014

Cited alongside, same era.

Jasin S, Sinha A (2015) An lp-based correlated rounding scheme for multi-item ecommerce order fulfillment. Operations Research 63(6):1336–1351

Vera A, Banerjee S (2021) The bayesian prophet: A low-regret framework for online decision making. Management Science 67(3):1368–1391

2021

Later among the works it cites.

Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via bellman inequalities. Operations Research

Original

2021

Later among the works it cites.

Aouad A, Ma W (2022) A nonparametric framework for online stochastic matching with correlated arrivals. arXiv preprint arXiv:2208.02229

Original

2022

Closest in time.

Balseiro S, Kroer C, Kumar R (2022) Online resource allocation under horizon uncertainty. arXiv preprint arXiv:2206.13606

Original

2022

Closest in time.

Jiang J, Ma W, Zhang J (2022b) Tight guarantees for multi-unit prophet inequalities and online stochastic knapsack. Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , 1221–1246 (SIAM)