Near-Optimal Pricing and Resource Allocation in a Large-Scale Service System

Published Online:https://doi.org/10.1287/opre.2024.1073

References

  • Ata B, Shneorson S (2006) Dynamic control of an M/M/1 service system with adjustable arrival and service rates. Management Sci. 52(11):1778–1791.LinkGoogle Scholar
  • Balseiro SR, Ma W, Zhang W (2025) Dynamic pricing for reusable resources: The power of two prices. Oper. Res., ePub ahead of print August 21, https://doi.org/10.1287/opre.2023.0475.Google Scholar
  • Bergquist J, Elmachtoub AN (2023) Static pricing guarantees for queueing systems. Preprint, submitted May 16, https://arxiv.org/abs/2305.09168.Google Scholar
  • Braverman A, Dai JG, Feng J (2016) Stein’s method for steady-state diffusion approximations: An introduction through the Erlang-A and Erlang-C models. Stochastic Systems 6(2):301–366.LinkGoogle Scholar
  • Cao P, He S, Huang J, Liu Y (2021) To pool or not to pool: Queueing design for large-scale service systems. Oper. Res. 69(6):1866–1885.LinkGoogle Scholar
  • Çelik S, Maglaras C (2008) Dynamic pricing and lead-time quotation for a multiclass make-to-order queue. Management Sci. 54(6):1132–1146.LinkGoogle Scholar
  • Chen QG, Jasin S, Duenyas I (2016) Real-time dynamic pricing with minimal and flexible price adjustment. Management Sci. 62(8):2437–2455.LinkGoogle Scholar
  • Chen QG, Lei YM, Jasin S (2023) Real-time spatial–intertemporal pricing and relocation in a ride-hailing network: Near-optimal policies and the value of dynamic pricing. Oper. Res. 72(5):2097–2118.LinkGoogle Scholar
  • Cox DR (1955) A use of complex probabilities in the theory of stochastic processes. Math. Proc. Cambridge Philos. Soc. 51(2):313–319.CrossrefGoogle Scholar
  • Eryilmaz A, Srikant R (2012) Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Systems 72:311–359.CrossrefGoogle Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Hall JM, Kopalle PK, Pyke DF (2009) Static and dynamic pricing of excess capacity in a make-to-order environment. Production Oper. Management 18(4):411–425.CrossrefGoogle Scholar
  • Hassin R, Haviv M (2003) To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, International Series in Operations Research & Management Science, vol. 59 (Springer, Boston).CrossrefGoogle Scholar
  • He X, Li L, Mo Y, Huang J, Qin SJ (2024) A distributed route network planning method with congestion pricing for drone delivery services in cities. Transportation Res. Part C: Emerging Tech. 160:104536.CrossrefGoogle Scholar
  • Huang L, Neely MJ (2011) Delay reduction via Lagrange multipliers in stochastic network optimization. IEEE Trans. Automatic Control 56(4):842–857.CrossrefGoogle Scholar
  • Ibrahim R, Whitt W (2009) Real-time delay estimation in overloaded multiserver queues with abandonments. Management Sci. 55(10):1729–1742.LinkGoogle Scholar
  • Ibrahim R, Whitt W (2011) Wait-time predictors for customer service systems with time-varying demand and capacity. Oper. Res. 59(5):1106–1118.LinkGoogle Scholar
  • Jasin S (2014) Reoptimization and self-adjusting price control for network revenue management. Oper. Res. 62(5):1168–1178.LinkGoogle Scholar
  • Kanoria Y, Qian P (2023) Blind dynamic resource allocation in closed networks via mirror backpressure. Management Sci. 70(8):5445–5462.LinkGoogle Scholar
  • Kerimov S, Ashlagi I, Gurvich I (2023a) Dynamic matching: Characterizing and achieving constant regret. Management Sci. 70(5):2799–2822.LinkGoogle Scholar
  • Kerimov S, Ashlagi I, Gurvich I (2023b) On the optimality of greedy policies in dynamic matching. Oper. Res. 73(1):560–582.LinkGoogle Scholar
  • Kim J, Randhawa RS (2018) The value of dynamic pricing in large queueing systems. Oper. Res. 66(2):409–425.LinkGoogle Scholar
  • Lee N, Kulkarni VG (2014) Optimal arrival rate and service rate control of multi-server queues. Queueing Systems 76(1):37–50.CrossrefGoogle 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.LinkGoogle Scholar
  • Lei YM, Jasin S, Sinha A (2018) Joint dynamic pricing and order fulfillment for e-commerce retailers. Manufacturing Service Oper. Management 20(2):269–284.LinkGoogle Scholar
  • Lei YM, Jasin S, Uichanco J, Vakhutinsky A (2022) Joint product framing (display, ranking, pricing) and order fulfillment under the multinomial logit model for e-commerce retailers. Manufacturing Service Oper. Management 24(3):1529–1546.LinkGoogle Scholar
  • Li H, Huh WT (2011) Pricing multiple products with the multinomial logit and nested logit models: Concavity and implications. Manufacturing Service Oper. Management 13(4):549–563.LinkGoogle Scholar
  • Li K, Cui S, Wang J (2021) On the optimal disclosure of queue length information. Naval Res. Logist. 68(5):615–630.CrossrefGoogle Scholar
  • Lin CA, Shang K, Sun P (2023) Wait time–Based pricing for queues with customer-chosen service times. Management Sci. 69(4):2127–2146.LinkGoogle Scholar
  • Lingenbrink D, Iyer K (2019) Optimal signaling mechanisms in unobservable queues. Oper. Res. 67(5):1397–1416.LinkGoogle Scholar
  • Lippman SA (1975) Applying a new device in the optimization of exponential queuing systems. Oper. Res. 23(4):687–710.LinkGoogle Scholar
  • Low DW (1974) Optimal dynamic pricing policies for an M/M/s queue. Oper. Res. 22(3):545–561.LinkGoogle Scholar
  • Maglaras C, Meissner J (2006) Dynamic pricing strategies for multiproduct revenue management problems. Manufacturing Service Oper. Management 8(2):136–148.LinkGoogle Scholar
  • Maglaras C, Zeevi A (2005) Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. 53(2):242–262.LinkGoogle Scholar
  • Maglaras C, Yao J, Zeevi A (2018) Optimal price and delay differentiation in large-scale queueing systems. Management Sci. 64(5):2427–2444.LinkGoogle Scholar
  • Maguluri ST, Srikant R (2013) Scheduling jobs with unknown duration in clouds. IEEE/ACM Trans. Networking 22(6):1938–1951.CrossrefGoogle Scholar
  • Manchiraju C, Dawande M, Janakiraman G, Raghunathan A (2024) Dynamic pricing and capacity optimization in railways. Manufacturing Service Oper. Management 26(1):350–369.LinkGoogle Scholar
  • Mandelbaum A, Reiman MI (1998) On pooling in queueing networks. Management Sci. 44(7):971–981.LinkGoogle Scholar
  • Neely MJ (2010) Stochastic Network Optimization with Application to Communication and Queueing Systems, Synthesis Lectures on Learning, Networks, and Algorithms (Springer, Cham, Switzerland).CrossrefGoogle Scholar
  • Qu Z, Dawande M, Janakiraman G (2024) Technical note—Cloud cost optimization: Model, bounds, and asymptotics. Oper. Res. 72(1):132–150.LinkGoogle Scholar
  • Robert P (2003) Stochastic Networks and Queues, Applications of Mathematics, vol. 52 (Springer, Berlin, Heidelberg).CrossrefGoogle Scholar
  • Rybko AN, Stolyar AL (1992) Ergodicity of stochastic processes describing the operation of open queueing networks. Problemy Peredachi Informatsii 28(3):3–26.Google Scholar
  • Stolyar AL (2004) MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic. Ann. Appl. Probab. 14(1):1–53.CrossrefGoogle Scholar
  • Sun X, Chai S, Paul A, Zhu L (2024) Enhancing make-to-order manufacturing agility: When flexible capacity meets dynamic pricing. Production Oper. Management 33(6):1354–1372.CrossrefGoogle Scholar
  • Sunar N, Tu Y, Ziya S (2021) Pooled vs. dedicated queues when customers are delay-sensitive. Management Sci. 67(6):3785–3802.LinkGoogle Scholar
  • Valogianni K, Ketter W, Collins J, Zhdanov D (2020) Sustainable electric vehicle charging using adaptive pricing. Production Oper. Management 29(6):1550–1572.CrossrefGoogle Scholar
  • Varma SM, Bumpensanti P, Maguluri ST, Wang H (2023) Dynamic pricing and matching for two-sided queues. Oper. Res. 71(1):83–100.LinkGoogle Scholar
  • Zheng X, Sun X, Shi C (2025) Joint learning and pricing in many-server queues: Near-optimal policies via fluid duality. Preprint, submitted May 7, https://doi.org/10.2139/ssrn.5239963.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.