Dynamic Allocation of Reusable Resources: Logarithmic Regret in Overloaded Networks

References

• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stochastic Systems 9(3):231–260.Link, Google Scholar
• Asmussen S (2003) Applied Probability and Queues, vol. 2 (Springer, New York).Google Scholar
• Baek J, Ma W (2022) Bifurcating constraints to improve approximation ratios for network revenue management with reusable resources. Oper. Res. 70(4):2226–2236.Google Scholar
• Bean NG, Gibbens RJ, Zachary S (1995) Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks. Adv. Appl. Probab. 27(1):273–292.Crossref, Google Scholar
• Bean NG, Gibbens RJ, Zachary S (1997) Dynamic and equilibrium behavior of controlled loss networks. Ann. Appl. Probab. 7(4):873–885.Crossref, Google Scholar
• Besbes O, Elmachtoub AN, Sun Y (2021) Static pricing: Universal guarantees for reusable resources. Oper. Res. 70(2):1143–1152.Link, Google Scholar
• Bumpensanti P, Wang H (2020) A re-solving heuristic with uniformly bounded loss for network revenue management. Management Sci. 66(7):2993–3009.Link, Google Scholar
• Cao H, Hu J, Jiang C, Kumar T, Li T-H, Liu Y, Lu Y, et al. (2011) Onthemark: Integrated stochastic resource planning of human capital supply chains. Interfaces 41(5):414–435.Link, Google Scholar
• Chen Y, Levi R, Shi C (2017) Revenue management of reusable resources with advanced reservations. Production Oper. Management 26(5):836–859.Crossref, Google Scholar
• Dawande M, Feng Z, Janakiraman G (2021) On the structure of bottlenecks in processes. Management Sci. 67(6):3853–3870.Link, Google Scholar
• Feng Y, Niazadeh R, Saberi A (2024) Near-optimal Bayesian online assortment of reusable resources. Oper. Res. Forthcoming.Google Scholar
• Gallego G, van Ryzin G (1997) A multiproduct dynamic pricing problem and its applications to network yield management. Oper. Res. 45(1):24–41.Link, Google Scholar
• Glynn P, Zeevi A (2008) Bounding stationary expectations of Markov processes. Markov Processes and Related Topics: A Festschrift for Thomas G. Kurtz, vol. 4 (Institute of Mathematical Statistics, Beachwood, OH), 195–214.Google Scholar
• Gong X-Y, Goyal V, Iyengar GN, Simchi-Levi D, Udwani R, Wang S (2021) Online assortment optimization with reusable resources. Management Sci. 68(7):4772–4785.Link, Google Scholar
• Goyal V, Iyengar G, Udwani R (2020) Online allocation of reusable resources: Achieving optimal competitive ratio. Preprint, submitted February 6, https://arxiv.org/abs/2002.02430.Google Scholar
• Gurvich I, Intelligent Automation (2018–2021) Dragons–dynamic resource allocation gains for operational networked sharing, Department of Defense (Army) STTR A18B-T007.Google Scholar
• Gurvich I, Van Mieghem JA (2015) Collaboration and multitasking in networks: Architectures, bottlenecks, and capacity. Manufacturing Service Oper. Management 17(1):16–33.Link, Google Scholar
• Hu J, Lu Y, Mojsilović A, Sharma M, Squillante MS (2010) Performance management of IT services delivery. Performance Evaluation Rev. 37(4):50–57.Crossref, Google Scholar
• Hui JY (2012) Switching and Traffic Theory for Integrated Broadband Networks, vol. 91 (Springer Science & Business Media, New York).Google Scholar
• Hunt PJ, Kurtz TG (1994) Large loss networks. Stochastic Processes Appl. 53(2):363–378.Crossref, Google Scholar
• Hunt PJ, Laws CN (1997) Optimization via trunk reservation in single resource loss systems under heavy traffic. Ann. Appl. Probab. 7(4):1058–1079.Crossref, Google Scholar
• Iyengar G, Sigman K (2004) Exponential penalty function control of loss networks. Ann. Appl. Probab. 14(4):1698–1740.Crossref, Google Scholar
• Janssen AJEM, Van Leeuwaarden J, Zwart B (2008) Gaussian expansions and bounds for the Poisson distribution applied to the Erlang B formula. Adv. Appl. Probab. 40(1):122–143.Crossref, Google Scholar
• Jasin S, Kumar S (2012) A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Math. Oper. Res. 37(2):313–345.Link, Google Scholar
• Jia H, Shi C, Shen S (2024) Online learning and pricing for service systems with reusable resources. Oper. Res. 72(3):1203–1241.Link, Google Scholar
• Jung K, Lu Y, Shah DD, Sharma M, Squillante M (2019) Revisiting stochastic loss networks: Structures and approximations. Math. Oper. Res. 44(3):890–918.Link, Google Scholar
• Kelly FP (1986) Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18(2):473–505.Crossref, Google Scholar
• Kelly FP (1991) Loss networks. Ann. Appl. Probab. 1(3):319–378.Crossref, Google Scholar
• Key PB (1990) Optimal control and trunk reservation in loss networks. Probab. Engrg. Inform. Sci. 4(2):203–242.Crossref, Google Scholar
• Lei YM, Jasin S (2020) Real-time dynamic pricing for revenue management with reusable resources, advance reservation, and deterministic service time requirements. Oper. Res. 68(3):676–685.Link, Google Scholar
• Levi R, Radovanović A (2010) Provably near-optimal LP-based policies for revenue management in systems with reusable resources. Oper. Res. 58(2):503–507.Link, Google Scholar
• Lippman SA (1975) Applying a new device in the optimization of exponential queuing systems. Oper. Res. 23(4):687–710.Link, Google Scholar
• Miller BL (1969) A queueing reward system with several customer classes. Management Sci. 16(3):234–245.Link, Google Scholar
• Morris B, Peres Y (2005) Evolving sets, mixing and heat kernel bounds. Probab. Theory Related Fields 133(2):245–266.Crossref, Google Scholar
• Morrison JA (2010) Optimal trunk reservation for an overloaded link. Oper. Res. Lett. 38(6):499–501.Crossref, Google Scholar
• Motwani R, Raghavan P (1995) Randomized Algorithms (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• Örmeci EL, van der Wal J (2006) Admission policies for a two class loss system with general interarrival times. Stochastic Models 22(1):37–53.Crossref, Google Scholar
• Örmeci EL, Burnetas A, van der Wal J (2001) Admission policies for a two class loss system. Stochastic Models 17(4):513–539.Crossref, Google Scholar
• Owen Z, Simchi-Levi D (2017) Price and assortment optimization for reusable resources. Preprint, submitted November 16, https://dx.doi.org/10.2139/ssrn.3070625.Google Scholar
• Paschalidis I, Liu Y (2002) Pricing in multiservice loss networks: Static pricing, asymptotic optimality and demand substitution effects. IEEE/ACM Trans. Networking 10(3):425–438.Crossref, Google Scholar
• Paschalidis I, Tsitsiklis J (2000) Congestion-dependent pricing of network services. IEEE/ACM Trans. Networking 8(2):171–184.Crossref, Google Scholar
• Puhalskii AA, Reiman MI (1998) A critically loaded multirate link with trunk reservation. Queueing Systems 28(1–3):157–190.Crossref, Google Scholar
• Puterman ML (2014) Markov Decision Processes: Discrete Stochastic Dynamic Programming (John Wiley & Sons, New York).Google Scholar
• Reiman MI (1991) Optimal trunk reservation for a critically loaded link. Jensen A, Iverson VB, eds. Teletraffic and Datatraffic: In a Period of Change (North Holland, Amsterdam), 247–252.Google Scholar
• Reiman MI, Wang Q (2008) An asymptotically optimal policy for a quantity-based network revenue management problem. Math. Oper. Res. 33(2):257–282.Link, Google Scholar
• Ross S (1996) Stochastic Processes (John Wiley & Sons, New York).Google Scholar
• Ross K, Tsang D (1989) Optimal circuit access policies in an ISDN environment: A Markov decision approach. IEEE Trans. Comm. 37(9):934–939.Crossref, Google Scholar
• Rusmevichientong P, Sumida M, Topaloglu H (2020) Dynamic assortment optimization for reusable products with random usage durations. Management Sci. 66(7):2820–2844.Link, Google Scholar
• Talluri KT, van Ryzin GJ (2004) The Theory and Practice of Revenue Management, International Series in Operations Research & Management Science, vol. 68 (Kluwer Academic Publishers, Boston).Crossref, Google Scholar
• Tsitsiklis JN, Xu K (2017) Flexible queueing architectures. Oper. Res. 65(5):1398–1413.Link, Google Scholar
• Tutte WT (1947) The factorization of linear graphs. J. London Math. Soc. s1-22(2):107–111.Crossref, Google Scholar
• Van der Boor M, Borst SC, Van Leeuwaarden JS, Mukherjee D (2018) Scalable load balancing in networked systems: Universality properties and stochastic coupling methods. Proc. Internat. Congress Math. (World Scientific, Singapore), 3893–3923.Google Scholar
• Vanderbei RJ (1998) Linear Programming—Foundations and Extensions, Kluwer International Series in Operations Research and Management Service, vol. 4 (Kluwer, London).Google Scholar
• Vera A, Banerjee S (2021) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar
• Vera A, Banerjee S, Gurvich I (2021) Online allocation and pricing: Constant regret via Bellman inequalities. Oper. Res. 69(3):821–840.Link, Google Scholar
• Williamson EL (1992) Airline network seat inventory control: Methodologies and revenue impacts. Unpublished PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.Google Scholar
• Xu H, Li B (2013) Dynamic cloud pricing for revenue maximization. IEEE Trans. Cloud Comput. 1(2):158–171.Crossref, Google Scholar