A Better Match for Drivers and Riders: Reinforcement Learning at Lyft
Published Online:7 Feb 2024https://doi.org/10.1287/inte.2023.0083
References
- (2020) Dynamic stochastic matching under limited time. Proc. 21st ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 789–790.Google Scholar
- (2019) Online vehicle routing: The edge of optimization in large-scale applications. Oper. Res. 67(1):143–162.Link, Google Scholar
- (2017) Surge pricing solves the wild goose chase. Accessed June 26, 2023, https://faculty.fuqua.duke.edu/ioconference/papers/2017/Castillo,%20Juan%20 Camilo_Surge_07_17.pdf.Google Scholar
- (2010) Parking infrastructure: Energy, emissions, and automobile life-cycle environmental accounting. Environ. Res. Lett. 5(3):034001.Google Scholar
- (2011) We are the 25%: Looking at street area percentages and surface parking. Accessed February 7, 2023, https://oldurbanist.blogspot.com/2011/12/we-are-25-looking-at-street-area.html.Google Scholar
- (2022) Real-time rideshare driver supply values using online reinforcement learning. Accessed June 26, 2023, https://dl.acm.org/doi/pdf/10.1145/3534678.3539141.Google Scholar
- (2019) Deep reinforcement learning for multi-driver vehicle dispatching and repositioning problem. Proc. 2019 IEEE Internat. Conf. Data Mining (ICDM) (Institute of Electrical and Electronics Engineers, Piscataway, NJ), 1090–1095.Google Scholar
- (2022) Dynamic type matching. Manufacturing Service Oper. Management 24(1):125–142.Link, Google Scholar
- (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1–2):83–97.Google Scholar
- (2022) Dynamic spatial matching. Proc. 23rd ACM Conf. Econom. Comput. (Association for Computing Machinery, New York), 63–64.Google Scholar
- (1990) An optimal algorithm for on-line bipartite matching. Proc. 22 Annual ACM Sympos. Theory Comput. (Association for Computing Machinery, New York), 352–358.Google Scholar
- (2018) Online spatio-temporal matching in stochastic and dynamic domains. Artificial Intelligence 261:71–112.Google Scholar
- (2020) Dynamic matching for real-time ride sharing. Stochastic Systems 10(1):29–70.Link, Google Scholar
- (2022) Reinforcement learning for ridesharing: An extended survey. Transportation Res. Part C Emerging Tech. 144:103852.Google Scholar
- (2020) Ride-hailing order dispatching at DiDi via reinforcement learning. INFORMS J. Appl. Anal. 50(5):272–286.Link, Google Scholar
- (2011) The High Cost of Free Parking (Routledge, Oxfordshire, UK).Google Scholar
- . (2017) Mastering the game of go without human knowledge. Nature 550(7676):354–359.Google Scholar
- (2018) Reinforcement Learning: An Introduction (MIT Press, Cambridge, MA).Google Scholar
- (1999) Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence 112(1–2):181–211.Google Scholar
- (2019) A deep value-network based approach for multi-driver order dispatching. Proc. 25th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 1780–1790.Google Scholar
- (2019) Ridesourcing systems: A framework and review. Transportation Res. Part B Methodological 129:122–155.Google Scholar
- Wikipedia (2023) Geohash. Accessed September 6, 2023, https://en.wikipedia.org/wiki/Geohash.Google Scholar
- (2018) Large-scale order dispatch in on-demand ride-hailing platforms: A learning and planning approach. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (Association for Computing Machinery, New York), 905–913.Google Scholar
- (2020) Dynamic pricing and matching in ride-hailing platforms. Naval Res. Logist. 67(8):705–724.Google Scholar
- (2022) The AI economist: Taxation policy design via two-level deep multiagent reinforcement learning. Accessed June 26, 2023, https://www.science.org/doi/10.1126/sciadv.abk2607.Google Scholar

