Repositioning, Ride-matching, and Abandonment in On-demand Ride-hailing Platforms: A Mean Field Game Approach
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915278962556928 |
|---|---|
| author | Li, Yunpeng Dimakis, Antonis Courcoubetis, Costas A. |
| author_facet | Li, Yunpeng Dimakis, Antonis Courcoubetis, Costas A. |
| contents | The on-demand ride-hailing industry has experienced rapid growth, transforming transportation norms worldwide. Despite improvements in efficiency over traditional taxi services, significant challenges remain, including drivers' strategic repositioning behavior, customer abandonment, and inefficiencies in dispatch algorithms. To address these issues, we introduce a comprehensive mean field game model that systematically analyzes the dynamics of ride-hailing platforms by incorporating driver repositioning across multiple regions, customer abandonment behavior, and platform dispatch algorithms. Using this framework, we identify all possible mean field equilibria as the Karush-Kuhn-Tucker (KKT) points of an associated optimization problem. Our analysis reveals the emergence of multiple equilibria, including the inefficient "Wild Goose Chase" one, characterized by drivers pursuing distant requests, leading to suboptimal system performance. To mitigate these inefficiencies, we propose a novel two-matching-radius nearest-neighbor dispatch algorithm that eliminates undesirable equilibria and ensures a unique mean field equilibrium for multi-region systems. The algorithm dynamically adjusts matching radii based on driver supply rates, optimizing pick-up times and waiting times for drivers while maximizing request completion rates. Numerical experiments and simulation results show that our proposed algorithm reduces customer abandonment, minimizes waiting times for both customers and drivers, and improves overall platform efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_02346 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Repositioning, Ride-matching, and Abandonment in On-demand Ride-hailing Platforms: A Mean Field Game Approach Li, Yunpeng Dimakis, Antonis Courcoubetis, Costas A. Computer Science and Game Theory The on-demand ride-hailing industry has experienced rapid growth, transforming transportation norms worldwide. Despite improvements in efficiency over traditional taxi services, significant challenges remain, including drivers' strategic repositioning behavior, customer abandonment, and inefficiencies in dispatch algorithms. To address these issues, we introduce a comprehensive mean field game model that systematically analyzes the dynamics of ride-hailing platforms by incorporating driver repositioning across multiple regions, customer abandonment behavior, and platform dispatch algorithms. Using this framework, we identify all possible mean field equilibria as the Karush-Kuhn-Tucker (KKT) points of an associated optimization problem. Our analysis reveals the emergence of multiple equilibria, including the inefficient "Wild Goose Chase" one, characterized by drivers pursuing distant requests, leading to suboptimal system performance. To mitigate these inefficiencies, we propose a novel two-matching-radius nearest-neighbor dispatch algorithm that eliminates undesirable equilibria and ensures a unique mean field equilibrium for multi-region systems. The algorithm dynamically adjusts matching radii based on driver supply rates, optimizing pick-up times and waiting times for drivers while maximizing request completion rates. Numerical experiments and simulation results show that our proposed algorithm reduces customer abandonment, minimizes waiting times for both customers and drivers, and improves overall platform efficiency. |
| title | Repositioning, Ride-matching, and Abandonment in On-demand Ride-hailing Platforms: A Mean Field Game Approach |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2504.02346 |