← Search

Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and the Value of Dynamic Pricing

Qi Chen1; Yanzhe Lei2; Stefanus Jasin3

1 London Business School, London NW1 4SA, United Kingdom; · 2 Smith School of Business, Queen’s University, Kingston, Ontario K7L 3N6, Canada · 3 Ross School of Business, University of Michigan , Ann Arbor, Michigan 48109,

Operations Research 2024

In “Real-Time Spatial–Intertemporal Pricing and Relocation in a Ride-Hailing Network: Near-Optimal Policies and The Value of Dynamic Pricing,” Chen, Lei, and Jasin consider a dynamic pricing problem faced by a ride-hailing service provider who manages a fixed number of servers and serves price-sensitive customers within a network. Servers serve arriving customers by relocating from the requested origins to destinations within a certain travel time. The authors first propose a static pricing policy based on the optimal solution to a deterministic relaxation of the original stochastic problem. They show that the proposed static policy matches the best possible asymptotic performance of any static policy. The authors further propose a dynamic pricing policy that adaptively changes the prices in a way that reduces the impact of past demand randomness on the balance of future distributions of servers and customers across the network. They show that the dynamic pricing policy achieves significantly better asymptotical performance. The proposed policies and their performance guarantees are further extended to a case where the firm jointly decides the relocation of vacant servers

DOI
10.1287/opre.2022.2425
Volume
72 (5)
Pages
2097-2118
Language
en
Export
BibTeX
Sources
crossref