Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework

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

References

  • Adelman D (2007) Price-directed control of a closed logistics queueing network. Oper. Res. 55(6):1022–1038.LinkGoogle Scholar
  • Afèche P, Liu Z, Maglaras C (2018) Ride-hailing networks with strategic drivers: The impact of platform control capabilities on performance. Preprint, submitted February 12, http://dx.doi.org/10.2139/ssrn.3120544.Google Scholar
  • Balseiro SR, Brown DB, Chen C (2021) Dynamic pricing of relocating resources in large networks. Management Sci. 67(7):4075–4094.LinkGoogle Scholar
  • Banerjee S, Johari R, Riquelme C (2015) Pricing in ride-sharing platforms: A queueing-theoretic approach. Proc. Sixteenth ACM Conf. Econom. Comput. (ACM), 639.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. CrossrefGoogle Scholar
  • Besbes O, Castro F, Lobel I (2021) Surge pricing and its spatial supply response. Management Sci. 67(3):1350–1367.LinkGoogle Scholar
  • Besbes O, Elmachtoub AN, Sun Y (2019) Static pricing: Universal guarantees for reusable resources. Proc. 2019 ACM Conf. Econom. Comput., 393–394.Google Scholar
  • Besbes O, Elmachtoub AN, Sun Y (2020) Pricing analytics for rotable spare parts. INFORMS J. Appl. Anal. 50(5):313–324.Google Scholar
  • Bimpikis K, Candogan O, Saban D (2019) Spatial pricing in ride-sharing networks. Oper. Res. 67(3):744–769.LinkGoogle Scholar
  • Braverman A, Dai JG, Liu X, Ying L (2019) Empty-car routing in ridesharing systems. Oper. Res. 67(5):1437–1452.LinkGoogle Scholar
  • Brooks JD, Kar K, Mendonça D (2013) Dynamic allocation of entities in closed queueing networks: An application to debris removal. Proc. 2013 IEEE Internat. Conf. Tech. Homeland Security, 504–510.Google Scholar
  • Bulow J, Klemperer P (2009) Why do sellers (usually) prefer auctions? Amer. Econom. Rev. 99(4):1544–1575.CrossrefGoogle Scholar
  • Buzen JP (1973) Computational algorithms for closed queueing networks with exponential servers. Comm. ACM 16(9):527–531.CrossrefGoogle Scholar
  • Castillo JC, Knoepfle D, Weyl G (2017) Surge pricing solves the wild goose chase. Proc. 2017 ACM Conf. Econom. Comput. (ACM), 241–242.Google Scholar
  • Chen Y, Hu M (2020) Pricing and matching with forward-looking buyers and sellers. Manufacturing Service Oper. Management 22(4):717–734.LinkGoogle Scholar
  • Chung H, Freund D, Shmoys DB (2018) Bike angels: An analysis of Citi bike’s incentive program. Proc. 1st ACM SIGCAS Conf. Comput. Sustainable Soc. (ACM), 5.Google Scholar
  • Fairs M (2017) Paris deputy mayor questions London’s approach to skyscrapers and public space. dezeen (September 15), https://www.dezeen.com/2017/09/12/paris-deputy-mayor-questions-london-approach-skyscrapers-public-space/.Google Scholar
  • Foley RD (1986) Stationary poisson departure processes from non-stationary queues. J. Appl. Probab. 23(1):256–260.CrossrefGoogle Scholar
  • Gallego G, Van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8):999–1020.LinkGoogle Scholar
  • George DK (2012) Stochastic modeling and decentralized control policies for large-scale vehicle sharing systems via closed queueing networks. PhD thesis, The Ohio State University, Columbus.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.CrossrefGoogle Scholar
  • George DK, Xia CH, Squillante MS (2012) Exact-order asymptotic analysis for closed queueing networks. J. Appl. Probab. 49(2):503–520.CrossrefGoogle Scholar
  • Gordon WJ, Newell GF (1967) Closed queuing systems with exponential servers. Oper. Res. 15(2):254–265.LinkGoogle Scholar
  • Hampshire RC, Massey WA, Wang Q (2009) Dynamic pricing to control loss systems with quality of service targets. Probab. Engrg. Inform. Sci. 23(02):357–383.CrossrefGoogle Scholar
  • Hartline JD (2013) Mechanism design and approximation. Accessed October 29, 2021, http://jasonhartline.com/MDnA/.Google Scholar
  • Hu M, Zhou Y (2017) Price, wage and fixed commission in on-demand matching. Preprint, submitted April 10, http://dx.doi.org/10.2139/ssrn.2949513.Google Scholar
  • Jackson JR (1963) Jobshop-like queueing systems. Management Sci. 10(1):131–142.LinkGoogle 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
  • Kelly FP (2011) Reversibility and Stochastic Networks (Cambridge University Press, Cambridge, United Kingdom).Google Scholar
  • Kelly F, Yudovina E (2014) Stochastic Networks, vol. 2 (Cambridge University Press, Cambridge, United Kingdom).CrossrefGoogle Scholar
  • Levi R, Radovanovic A (2010) Provably near-optimal LP-based policies for revenue management in systems with reusable resources. Oper. Res. 58(2):503–507.LinkGoogle Scholar
  • Lyft (2018) Personalized power zones. Accessed October 29, 2021, https://thehub.lyft.com/blog/personal-power-zones.Google Scholar
  • Ma H, Fang F, Parkes DC (2018) Spatio-temporal pricing for ridesharing platforms. Preprint, submitted January 11, https://arxiv.org/abs/1801.04015.Google Scholar
  • Milgrom P, Segal I (2014) Deferred-acceptance auctions and radio spectrum reallocation. Proc. Fifteenth ACM Conf. Econom. Comput. (ACM), 185–186.Google Scholar
  • Newell GF (1966) The m/g/¥ queue. SIAM J. Appl. Math. 14(1):86–88.CrossrefGoogle Scholar
  • Ong HY, Freund D, Crapis D (2021) Driver positioning and incentive budgeting with an escrow mechanism for ridesharing platforms. Preprint, submitted May 3, https://arxiv.org/pdf/2104.14740.pdf.Google Scholar
  • Özkan E (2020) Joint pricing and matching in ride-sharing systems. Eur. J. Oper. Res. 287(3):1149–1160.CrossrefGoogle Scholar
  • Özkan E, Ward AR (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.LinkGoogle Scholar
  • Qian P, Banerjee S, Kanoria Y (2018) The value of state dependent control in ridesharing systems. Preprint, submitted March 13, https://arxiv.org/abs/1803.04959v1.Google Scholar
  • Ramsey FP (1927) A contribution to the theory of taxation. Econom. J. 37(145):47–61.Google Scholar
  • Reiser M, Lavenberg SS (1980) Mean-value analysis of closed multichain queuing networks. J. ACM 27(2):313–322.CrossrefGoogle Scholar
  • Séjourné T, Samaranayake S, Banerjee S (2018) The price of fragmentation in mobility-on-demand services. Proc. ACM Measurement Anal. Comput. Systems.Google Scholar
  • Serfozo R (1999) Introduction to Stochastic Networks (Springer, Berlin).Google Scholar
  • Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Comm. ACM 28(2):202–208.CrossrefGoogle Scholar
  • Uber (2018) Your questions about the new surge, answered. Accessed August 15, 2018, https://www.uber.com/blog/your-questions-about-the-new-surge-answered/.Google Scholar
  • Waserhole A, Jost V (2016) Pricing in vehicle sharing systems: Optimization in queuing networks with product forms. EURO J. Transportation Logist. 5(2014):293–320.Google Scholar
  • Whitt W (1984) Open and closed models for networks of queues. ATT Bell Laboratory Tech. J. 63(9):1911–1979.CrossrefGoogle Scholar
  • Whittle P (1985) Scheduling and characterization problems for stochastic networks. J. Roy. Statist. Soc. B 47(3):407–428.Google Scholar
  • Zahorjan J, Sevcik KC, Eager DL, Galler B (1982) Balanced job bound analysis of queueing networks. Comm. ACM 25(2):134–141.CrossrefGoogle Scholar
  • Zhang R, Pavone M (2016) Control of robotic mobility-on-demand systems: A queueing-theoretical perspective. Internat. J. Robotics Res. 35(1-3):186–203.CrossrefGoogle Scholar
  • Zhong Y, Wan Z, Shen Z-JM (2020) Queueing vs. surge pricing mechanism: Efficiency, equity, and consumer welfare. Preprint, submitted October 13, http://dx.doi.org/10.2139/ssrn.3699134.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.