The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Stable Matching for Dynamic Ride-Sharing Systems
Open accessAbstract
Dynamic ride-sharing systems enable people to share rides and increase the efficiency of urban transportation by connecting riders and drivers on short notice. Automated systems that establish ride-share matches with minimal input from participants provide convenience and the most potential for system-wide performance improvement, such as reduction in total vehicle-miles traveled. Indeed, such systems may be designed to match riders and drivers to maximize system performance improvement. However, system-optimal matches may not provide the maximum benefit to each individual participant. In this paper, we consider a notion of stability for ride-share matches and present several mathematical programming methods to establish stable or nearly stable matches, where we note that ride-share matching optimization is performed over time with incomplete information. Our numerical experiments using travel demand data for the metropolitan Atlanta region show that we can significantly increase the stability of ride-share matching solutions at the cost of only a small degradation in system-wide performance.
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
17. A Value for n-Person Games
Shapley, L. S. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-018 · Cited by 6,950
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
Koutsoupias, E., & Papadimitriou, C. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49116-3_38 · Cited by 1,806
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis
Roth, A. E., & Sotomayor, M. A. O. (1990) · Cambridge University Press eBooks · doi:10.1017/ccol052139015x · Cited by 1,340
The evolution of the labor market for medical interns and residents: A case study in game theory
Roth, A. E. (1984) · Journal of Political Economy · doi:10.1086/261272 · Cited by 1,219
Optimization for dynamic ride-sharing: A review
Agatz, N., Erera, A., Savelsbergh, M., & Wang, X. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.05.028 · Cited by 1,008
Self-citationRidesharing: The state-of-the-art and future directions
Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.-E., Wang, X., & Koenig, S. (2013) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2013.08.012 · Cited by 885
Self-citationCrowdsourced Delivery—A Dynamic Pickup and Delivery Problem with Ad Hoc Drivers
Arslan, A. M., Agatz, N., Kroon, L., & Zuidwijk, R. (2019) · Transportation Science · doi:10.1287/trsc.2017.0803 · Cited by 511
Self-citationDynamic ride-sharing: A simulation study in metro Atlanta
Agatz, N. A. H., Erera, A. L., Savelsbergh, M. W. P., & Wang, X. (2011) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2011.05.017 · Cited by 475
Self-citationWhat Have We Learned from Market Design?
Roth, A. E. (2008) · The Economic Journal · doi:10.1111/j.1468-0297.2007.02121.x · Cited by 383
The benefits of meeting points in ride-sharing systems
Stiglic, M., Agatz, N., Savelsbergh, M., & Gradisar, M. (2015) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2015.07.025 · Cited by 321
Self-citationHard variants of stable marriage
Manlove, D. F., Irving, R. W., Iwama, K., Miyazaki, S., & Morita, Y. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00206-7 · Cited by 311
Stable marriage and indifference
Irving, R. W. (1994) · Discrete Applied Mathematics · doi:10.1016/0166-218x(92)00179-p · Cited by 283
An efficient algorithm for the “optimal” stable marriage
Irving, R. W., Leather, P., & Gusfield, D. (1987) · Journal of the ACM · doi:10.1145/28869.28871 · Cited by 258
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Baldacci, R., Maniezzo, V., & Mingozzi, A. (2004) · Operations Research · doi:10.1287/opre.1030.0106 · Cited by 245
Stable Matchings, Optimal Assignments, and Linear Programming
Roth, A. E., Rothblum, U. G., & Vande Vate, J. H. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.4.803 · Cited by 182
Stable Marriage with Incomplete Lists and Ties
Iwama, K., Manlove, D., Miyazaki, S., & Morita, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48523-6_41 · Cited by 180
A distributed geographic information system for the daily car pooling problem
Calvo, R. W., de Luigi, F., Haastrup, P., & Maniezzo, V. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(03)00186-2 · Cited by 172
Linear programming brings marital bliss
Vande Vate, J. H. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90041-2 · Cited by 172
A Survey of the Stable Marriage Problem and Its Variants
Iwama, K., & Miyazaki, S. (2008) · International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008) · doi:10.1109/icks.2008.7 · Cited by 166
New physicians: A natural experiment in market organization
Roth, A. E. (1990) · Science · doi:10.1126/science.2274783 · Cited by 141
Characterization of stable matchings as extreme points of a polytope
Rothblum, U. G. (1992) · Mathematical Programming · doi:10.1007/bf01586041 · Cited by 139
Clearinghouses for two-sided matching: An experimental study
Echenique, F., Wilson, A. J., & Yariv, L. (2016) · Quantitative Economics · doi:10.3982/qe496 · Cited by 67
The Uniqueness of Stable Matchings
Clark, S. (2006) · Contributions in Theoretical Economics · doi:10.2202/1534-5971.1283 · Cited by 59
Anarchy, Stability, and Utopia: Creating Better Matchings
Anshelevich, E., Das, S., & Naamad, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04645-2_15 · Cited by 35
Cited by
Ridesourcing systems: A framework and review
Wang, H., & Yang, H. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.07.009 · Cited by 538
A survey of models and algorithms for optimizing shared mobility
Mourad, A., Puchinger, J., & Chu, C. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.02.003 · Cited by 309
Planning of truck platoons: A literature review and directions for future research
Bhoopalam, A. K., Agatz, N., & Zuidwijk, R. (2018) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.10.016 · Cited by 298
Self-citation
Metadata
- Authors
- Wang, X., Agatz, N., & Erera, A.
- Venue
- Transportation Science
- Published
- 2018-08
- Volume
- 52
- Issue
- 4
- Pages
- 850-867
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2748861460
- Cited by
- 268
- References
- 25
- FWCI
- 12.25
- Type
- journal article
- Language
- en
- Open access
- green
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
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.