Non-Exclusive Notifications for Ride-Hailing at Lyft II: Simulations and Marketplace Analysis

2026-03-22

AI Summary

This study addresses the inefficiencies of traditional one-to-one exclusive ride dispatching, which often suffers from matching delays due to driver rejections or response timeouts, thereby reducing platform efficiency. The authors propose a non-exclusive dispatch mechanism that broadcasts each order to multiple drivers and develop an integrated evaluation framework combining a constrained welfare-maximization optimization model, large-scale discrete-event simulations based on real Lyft data, and macroscopic equilibrium analysis. Their findings reveal a fundamental trade-off between matching speed and service quality, demonstrating that non-exclusive dispatch significantly reduces matching time, decreases passenger abandonment, and improves both order completion rates and average service quality. Furthermore, they introduce a conservative notification strategy that mitigates over-allocation of high-value drivers, thereby enhancing long-term market efficiency.

Technology Category

• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Search and Optimization: Distributed Search
• Constraint Satisfaction and Optimization: Distributed CSP/Optimization

Application Category

• Economics, Online Markets and Human Computation: The sharing economy
• Responsible Web: Human-perceived consequences of algorithmic deployment on the web
• Security and Privacy: Large-scale security measurements

Abstract

Ride-hailing platforms increasingly face uncertain driver acceptance, which makes traditional one-to-one 'exclusive dispatch (ED)' less efficient: rejections and timeouts force sequential retries and lengthen rider wait times, which in turn creates friction in the marketplace. 'Non-exclusive dispatch (NED)' mitigates this friction by broadcasting a request to multiple drivers in parallel. While NED can reduce latency, it introduces new design challenges -- most notably, how to choose notification sets and how to resolve driver contention (when multiple drivers accept the same ride). In this paper -- the second in a two-part collaboration with Lyft -- we develop a theoretically grounded framework to evaluate the long-run performance and marketplace effects of transitioning from ED to NED. We bridge theory and practice by combining (i) an optimization model that formulates NED as a constrained welfare maximization problem with (ii) large-scale discrete-event simulations on proprietary Lyft traces and (iii) a stylized macroscopic equilibrium model. Across simulation and equilibrium analysis, we find that NED improves key fulfillment metrics relative to ED: it reduces match time (and hence rider reneging) while increasing both the number and the average quality of completed matches. We also quantify the speed--quality trade-off between two common contention resolution rules, 'First-Accept' and 'Best-Accept': First-Accept maximizes speed and throughput, whereas Best-Accept is required to maximize per-match quality. Finally, we show that slightly conservative notification heuristics can improve long-run efficiency by avoiding excessive locking of high-value drivers and preserving future availability.

Problem

• ride-hailing
• non-exclusive dispatch
• driver acceptance uncertainty
• marketplace friction
• contention resolution

Innovation

• Non-Exclusive Dispatch
• Marketplace Equilibrium
• Discrete-Event Simulation
• Welfare Maximization
• Contention Resolution