Journal article · 2025 · Open access
Feature-Based Dynamic Matching
Operations Research, 74(2), 788–803 · Published 18 November 2025 · DOI 10.1287/opre.2024.0730
In brief
“Feature-Based Dynamic Matching” is a 2025 journal article by Yilun Chen and 3 co-authors, published in Operations Research. OpenAlex counts 10 citations as of 16 November 2026. It is open access: the full text is free to read at SSRN Electronic Journal.
- Citations
- 10
- Most cited in
- 2026 (5)
- Field-weighted impact
- 4.27
- References
- 74
- Authors
- 4
Abstract
SOAR ing to Optimality: Smarter Matching Algorithms for On-Demand Platforms In “Feature-Based Dynamic Matching,” Y. Chen, Y. Kanoria, A. Kumar, and W. Zhang study dynamic two-sided matching where both customers and service providers are characterized by high-dimensional feature vectors, motivated by platforms like on-demand home services. A key finding is that myopic greedy policies—which match each customer to the best available provider—can be highly suboptimal. The authors introduce SOAR (simulate-optimize-assign-repeat), a forward-looking algorithm that balances immediate match quality against preserving valuable supply for future arrivals. Through a novel analytical framework connecting dynamic matching to empirical optimal transport, they prove SOAR achieves near-optimal regret scaling under various distributional assumptions, establishing fundamental performance limits for feature-based matching problems and as a by-product resolve an open problem from prior work on dynamic spatial matching.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Chen, Y., Kanoria, Y., Kumar, A., & Zhang, W. (2025). Feature-Based Dynamic Matching. Operations Research, 74(2), 788–803. https://doi.org/10.1287/opre.2024.0730
MLA 9
Chen, Yilun, et al. “Feature-Based Dynamic Matching.” Operations Research, vol. 74, no. 2, 2025, pp. 788–803. https://doi.org/10.1287/opre.2024.0730.
Chicago
Chen, Yilun, Yash Kanoria, Akshit Kumar, and Wenxin Zhang. 2025. “Feature-Based Dynamic Matching.” Operations Research 74 (2): 788–803. https://doi.org/10.1287/opre.2024.0730.
Harvard
Chen, Y. et al. (2025) ‘Feature-Based Dynamic Matching’, Operations Research, 74(2), pp. 788–803. doi:10.1287/opre.2024.0730.
IEEE
Y. Chen, Y. Kanoria, A. Kumar, and W. Zhang, “Feature-Based Dynamic Matching,” Operations Research, vol. 74, no. 2, pp. 788–803, 2025, doi: 10.1287/opre.2024.0730.
BibTeX
@article{chen2025feature,
title = {{Feature-Based Dynamic Matching}},
author = {Chen, Yilun and Kanoria, Yash and Kumar, Akshit and Zhang, Wenxin},
journal = {Operations Research},
year = {2025},
volume = {74},
number = {2},
pages = {788--803},
doi = {10.1287/opre.2024.0730},
url = {https://doi.org/10.1287/opre.2024.0730}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2022 | 1 | |
| 2024 | 1 | |
| 2025 | 3 | |
| 2026 | 5 |
Its field-weighted citation impact is 4.27: it has been cited 4.27 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- feature-based matching
- regret bounds
- optimal transport
- matching platforms
- high-dimensional feature vectors
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Chen, Y., Kanoria, Y., Kumar, A., & Zhang, W. (2025). Feature-Based Dynamic Matching. Operations Research, 74(2), 788–803. https://doi.org/10.1287/opre.2024.0730
How many times has this paper been cited?
10 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at SSRN Electronic Journal: sign in and open the full text from this page.
Who wrote this paper?
Yilun Chen, Yash Kanoria, Akshit Kumar, Wenxin Zhang.
What is the DOI of this paper?
10.1287/opre.2024.0730, permanently at https://doi.org/10.1287/opre.2024.0730. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.