The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Dynamic pricing and matching in ride‐hailing platforms
Abstract
Ride‐hailing platforms such as Uber, Lyft, and DiDi have achieved explosive growth and reshaped urban transportation. The theory and technologies behind these platforms have become one of the most active research topics in the fields of economics, operations research, computer science, and transportation engineering. In particular, advanced matching and dynamic pricing (DP) algorithms—the two key levers in ride‐hailing—have received tremendous attention from the research community and are continuously being designed and implemented at industrial scales by ride‐hailing platforms. We provide a review of matching and DP techniques in ride‐hailing, and show that they are critical for providing an experience with low waiting time for both riders and drivers. Then we link the two levers together by studying a pool‐matching mechanism called dynamic waiting (DW) that varies rider waiting and walking before dispatch, which is inspired by a recent carpooling product Express Pool from Uber. We show using data from Uber that by jointly optimizing DP and DW, price variability can be mitigated, while increasing capacity utilization, trip throughput, and welfare. We also highlight several key practical challenges and directions of future research from a practitioner's perspective.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Hungarian method for the assignment problem
Kuhn, H. W. (1955) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800020109 · Cited by 13,120
Angrist, J. D., & Krueger, A. B. (2001) · Journal of Economic Perspectives · doi:10.1257/jep.15.4.69 · Cited by 2,355
Elmaghraby, W., & Keskinocak, P. (2003) · Management Science · doi:10.1287/mnsc.49.10.1287.17315 · Cited by 1,285
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611675114 · Cited by 1,186
Disruptive Change in the Taxi Business: The Case of Uber
Cramer, J., & Krueger, A. B. (2016) · American Economic Review · doi:10.1257/aer.p20161002 · Cited by 825
The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity
Cachon, G. P., Daniels, K. M., & Lobel, R. (2017) · Manufacturing & Service Operations Management · doi:10.1287/msom.2017.0618 · Cited by 724
The Theory and Measurement of Private and Social Cost of Highway Congestion
Walters, A. A. (1961) · Econometrica · doi:10.2307/1911814 · Cited by 683
(1982) · Journal of Criminal Justice · doi:10.1016/0047-2352(82)90013-7 · Cited by 669
Taylor, T. A. (2018) · Manufacturing & Service Operations Management · doi:10.1287/msom.2017.0678 · Cited by 600
Coordinating Supply and Demand on an On-Demand Service Platform with Impatient Customers
Bai, J., So, K. C., Tang, C. S., Chen, X. (., & Wang, H. (2019) · Manufacturing & Service Operations Management · doi:10.1287/msom.2018.0707 · Cited by 580
Cited by
Rajendran, S., & Srinivas, S. (2020) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2020.102090 · Cited by 256
Zhang, A., Boltz, A., Wang, C. W., & Lee, M. K. (2022) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3491102.3501866 · Cited by 166
Metadata
- Authors
- Yan, C., Zhu, H., Korolko, N., & Woodard, D.
- Venue
- Naval Research Logistics (NRL)
- Publisher
- Wiley
- Published
- 2019-11-15
- Volume
- 67
- Issue
- 8
- Pages
- 705-724
- ISSN
- 0894-069X (ISSN-L)
- 1520-6750
- OpenAlex
- W2909452395
- Cited by
- 321
- References
- 24
- FWCI
- 12.59
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic pricing and matching in ride‐hailing platforms. https://app.cochat.ai/papers/10.1002/nav.21872
- The paper
- Yan, C., Zhu, H., Korolko, N., & Woodard, D. (2020). Dynamic pricing and matching in ride‐hailing platforms. Naval Research Logistics (NRL). https://doi.org/10.1002/nav.21872
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.