Dynamic Pricing of Relocating Resources in Large Networks

References

• Adelman D (2007) Price-directed control of a closed logistics queueing network. Oper. Res. 55(6):1022–1038.Link, Google Scholar
• Adelman D , Mersereau AJ (2008) Relaxations of weakly coupled stochastic dynamic programs. Oper. Res. 56(3):712–727.Link, Google Scholar
• An Y , Zhang Y , Zeng B (2015) The reliable hub-and-spoke design problem: Models and algorithms. Transportation Res. Part B: Methodological 77(July):103–122.Crossref, Google Scholar
• Banerjee S , Freund D , Lykouris T (2017) Pricing and optimization in shared vehicle systems: An approximation framework. Preprint, submitted May 16, https://arxiv.org/pdf/1608.06819.pdf.Google Scholar
• Banerjee S , Kanoria Y , Qian P (2018) State dependent control of closed queueing networks. Abstracts 2018 ACM Internat. Conf. Measurement Model. Comput. Systems (ACM, New York), 2–4.Google Scholar
• Baskett F , Chandy KM , Muntz RR , Palacios FG (1975) Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2):248–260.Crossref, Google Scholar
• Bertsimas D , Mersereau AJ (2007) A learning approach for interactive marketing to a customer segment. Oper. Res. 55(6):1120–1135.Link, Google Scholar
• Bertsimas D , Mišić VV (2016) Decomposable Markov decision processes: A fluid optimization approach. Oper. Res. 64(6):1537–1555.Link, Google Scholar
• Besbes O , Castro F , Lobel I (2018a) Surge pricing and its spatial supply response. Preprint, submitted February 27, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3124571.Google Scholar
• Besbes O , Castro F , Lobel I (2018b) Spatial capacity planning. Preprint, submitted December 13, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3292651.Google Scholar
• Bimpikis K , Candogan O , Daniela S (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.Link, Google Scholar
• Braverman A , Dai JG , Liu X , Ying L (2016) Empty-car routing in ridesharing systems. Preprint, submitted September 23, https://arxiv.org/abs/1609.07219.Google Scholar
• Brown DB , Smith JE (2020) Index policies and performance bounds for dynamic selection problems. Management Sci. 77(7):3029–3050.Link, Google Scholar
• Caro F , Gallien J (2007) Dynamic assortment with demand learning for seasonal consumer goods. Management Sci. 53(2):276–292.Link, Google Scholar
• Du Y , Hall R (1997) Fleet sizing and empty equipment redistribution for center-terminal transportation networks. Management Sci. 43(2):145–157.Link, Google Scholar
• George DK , Xia CH (2011) Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. Eur. J. Oper. Res. 211(1):198–207.Crossref, Google Scholar
• Gordon WJ , Newell GF (1967) Closed queuing systems with exponential servers. Oper. Res. 15(2):254–265.Link, Google Scholar
• Harrison JM , Wein LM (1990) Scheduling networks of queues: Heavy traffic analysis of a two-station closed network. Oper. Res. 38(6):1052–1064.Link, Google Scholar
• Hawkins JT (2003) A Langrangian decomposition approach to weakly coupled dynamic optimization problems and its applications. PhD thesis, Massachusetts Institute of Technology, Cambridge.Google Scholar
• Hu W , Frazier P (2017) An asymptotically optimal index policy for finite-horizon restless bandits. Preprint, submitted July 1, https://arxiv.org/abs/1707.00205.Google Scholar
• Kanoria Y , Qian P (2019) Near optimal control of a ride-hailing platform via mirror backpressure. Preprint, submitted March 7, https://arxiv.org/abs/1903.02764v1.Google Scholar
• Kumar S , Kumar P (1996) Closed queueing networks in heavy traffic: Fluid limits and efficiency. Glasserman P , Sigman K , Yao DD , eds. Stochastic Networks , Lecture Notes in Statistics, vol. 117 (Springer, New York), 41–64.Crossref, Google Scholar
• Kunnumkal S , Talluri K (2016) On a piecewise-linear approximation for network revenue management. Math. Oper. Res. 41(1):72–91.Link, Google Scholar
• Marklund J , Rosling K (2012) Lower bounds and heuristics for supply chain stock allocation. Oper. Res. 60(1):92–105.Link, Google Scholar
• Miao S , Jasin S , Chao X (2020) Asymptotically optimal Lagrangian policies for one-warehouse multi-store system with lost sales. Preprint, submitted April 6, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3552995.Google Scholar
• Ozkan E , Ward A (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Google Scholar
• Pirkul H , Schilling DA (1998) An efficient procedure for designing single allocation hub and spoke systems. Management Sci. 44(2):235–242.Link, Google Scholar
• RideAustin (2017) Ride-Austin-june6-april13 [data file and code book]. Accessed January 19, 2019, https://data.world/ride-austin/ride-austin-june-6-april-13.Google Scholar
• Song D-P , Carter J (2008) Optimal empty vehicle redistribution for hub-and-spoke transportation systems. Naval Res. Logist. 55(2):156–171.Crossref, Google Scholar
• Talluri K , van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577–1593.Link, Google Scholar
• Topaloglu H (2009) Using Lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Oper. Res. 57(3):637–649.Link, Google Scholar
• Tran TH , O’Hanley JR , Scaparra MP (2017) Reliable hub network design: Formulation and solution techniques. Transportation Sci. 51(1):358–375.Link, Google Scholar
• Vera A , Banerjee S (2019) The Bayesian prophet: A low-regret framework for online decision making. ACM Sigmetrics Performance Evaluation Rev. 47(1):81–82.Google Scholar
• Waserhole A , Jost V (2016) Pricing in vehicle sharing systems: Optimization in queuing networks with product forms. EURO J. Transportation Logist. 5(3):293–320.Crossref, Google Scholar
• Whitt W (1984) Open and closed models for networks of queues. Bell Labs Tech. J. 63(9):1911–1979.Crossref, Google Scholar
• Zayas-Cabán G , Jasin S , Wang G (2019) An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits. Adv. Appl. Probab. 51(3):745–772.Crossref, Google Scholar