Stable Matching for Dynamic Ride-Sharing Systems

Published Online:https://doi.org/10.1287/trsc.2017.0768

References

  • Agatz NAH, Erera A, Savelsbergh MWP, Wang X (2011) Dynamic ride-sharing: A simulation study in metro Atlanta. Transportation Res. Part B 45(9):1450–1464.CrossrefGoogle Scholar
  • Agatz NAH, Erera A, Savelsbergh MWP, Wang X (2012) Optimization for dynamic ride-sharing: A review. Eur. J. Oper. Res. 223(2):295–303.CrossrefGoogle Scholar
  • American Automobile Association (2009) Your driving costs: How much are you really paying to drive? Technical report, American Automobile Association, Heathrow, FL.Google Scholar
  • American Automobile Association (2013) Your driving costs: How much are you really paying to drive? Technical report, American Automobile Association, Heathrow, FL.Google Scholar
  • Amey A (2011) Proposed methodology for estimating rideshare viability within an organization: Application to the MIT community. Transportation Res. Board Annual Meeting 2011, Paper 11-2585.Google Scholar
  • Anshelevich E, Das S, Naamad Y (2009) Anarchy, stability, and utopia: Creating better matchings. Mavronicolas M, Papadopoulou VG, eds. Algorithmic Game Theory, Lecture Notes Comput. Sci., Vol. 5814 (Springer, Berlin Heidelberg), 159–170.CrossrefGoogle Scholar
  • Anshelevich E, Dasgupta A, Kleinberg J, Tardos E, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4):1602–1623.CrossrefGoogle Scholar
  • Arslan A, Agatz N, Kroon L, Zuidwijk R (2018) Crowdsourced delivery: A dynamic pickup and delivery problem with ad-hoc drivers. Transportation Sci., ePub ahead of print July 9, https://doi.org/10.1287/trsc.2017.0803.LinkGoogle Scholar
  • Baldacci R, Maniezzo V, Mingozzi A (2004) An exact method for the car pooling problem based on Lagrangean column generation. Oper. Res. 52(3):422–439.LinkGoogle Scholar
  • Clark S (2006) The uniqueness of stable matchings. Contributions Theor. Econom. 6(1):1–28.CrossrefGoogle Scholar
  • Echenique F, Wilson AJ, Yariv L (2016) Clearinghouses for two-sided matching: An experimental study. Quant. Econom. 7(2):449–482.CrossrefGoogle Scholar
  • European Environment Agency (2010) Occupancy rates of passenger vehicles. Technical report, European Environment Agency, Copenhagen.Google Scholar
  • Furuhata M, Dessouky M, Ordónez F, Brunet ME, Wang X, Koenig S (2013) Ridesharing: The state-of-the-art and future directions. Transportation Res. Part B 57:28–46.CrossrefGoogle Scholar
  • Gale D, Shapley LS (1962) College admissions and the stability of marriage. Amer. Math. Monthly 69(1):9–15.CrossrefGoogle Scholar
  • Geron T (2013) Tickengo’s Willie Brown wants revenue cap for ride-sharing drivers. Forbes (January 28), http://www.forbes.com/sites/tomiogeron/2013/01/28/tickengos-willie-brown-wants-revenue-cap-for-ride-sharing-drivers/.Google Scholar
  • Ghoseiri K, Haghani A, Hamedi M (2011) Real-time Rideshare Matching Problem (Mid-Atlantic Universities Transportation Center, University Park, PA).Google Scholar
  • Irving RW (1994) Stable marriage and indifference. Discrete Appl. Math. 48(3):261–272.CrossrefGoogle Scholar
  • Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the “optimal” stable marriage. J. ACM 34(3):532–543.CrossrefGoogle Scholar
  • Iwama K, Miyazaki S (2008) A survey of the stable marriage problem and its variants. Proc. Internat. Conf. Informatics Ed. Res. Knowledge-Circulating Soc. (IEEE Computer Society, Washington, DC), 131–136.CrossrefGoogle Scholar
  • Iwama K, Manlove D, Miyazaki S, Morita Y (1999) Stable marriage with incomplete lists and ties. Wiedermann J, van Emde Boas P, Nielsen M, eds. Automata, Languages and Programming, Lecture Notes Comput. Sci., Vol. 1644 (Springer-Verlag, Berlin Heidelberg), 443–452.CrossrefGoogle Scholar
  • Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. Meinel C, Tison S, eds. Proc. 16th Annual Conf. Theoret. Aspects Comput. Sci., Lecture Notes Comput Sci., Vol. 1563 (Springer-Verlag, Berlin Heidelberg), 404–413.CrossrefGoogle Scholar
  • Lee A, Savelsbergh M (2015) Dynamic ridesharing: Is there a role for dedicated drivers? Transportation Res. Part B 81:483–497.CrossrefGoogle Scholar
  • Manlove DF, Irving RW, Iwama K, Miyazaki S, Morita Y (2002) Hard variants of stable marriage. Theor. Comput. Sci. 276(1):261–279.CrossrefGoogle Scholar
  • McGuckin N, Srinivasan N (2003) Journey to work trends in the United States and its major metropolitan areas 1960–2000. Technical report, U.S. Department of Transportation Federal Highway Administration, Washington, DC.Google Scholar
  • Roth AE (1984) The evolution of the labor market for medical interns and residents: A case study in game theory. J. Political Econom. 92(6):991–1016.CrossrefGoogle Scholar
  • Roth AE (1990) New physicians: A natural experiment in market organization. Science 250(4987):1524–1528.CrossrefGoogle Scholar
  • Roth AE (1991) A natural experiment in the organization of entry-level labor markets: Regional markets for new physicians and surgeons in the United Kingdom. Amer. Econom. Rev. 81(3):415–440.Google Scholar
  • Roth AE (2008) What have we learned from market design? Econom. J. 118(527):285–310.CrossrefGoogle Scholar
  • Roth AE, Sotomayor MAO (1990) Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis, Econometric Society Monographs, Vol. 18 (Cambridge University Press, Cambridge, UK).CrossrefGoogle Scholar
  • Roth AE, Rothblum UG, Vande Vate JH (1993) Stable matchings, optimal assignments and linear programming. Math. Oper. Res. 18(4):803–828.LinkGoogle Scholar
  • Rothblum UG (1992) Characterization of stable matchings as extreme points of a polytope. Math. Programming 54(1–3):57–67.CrossrefGoogle Scholar
  • Shapley LS (1953) A value for n-person games. Kuhn HW, Tucker AW, eds. Contributions to the Theory of Games, Ann. Math. Stud., 28 (Princeton University Press, Princeton, NJ), 307–317.CrossrefGoogle Scholar
  • Sivak M (2013) Effects of vehicle fuel economy, distance travelled, and vehicle load on the amount of fuel used for personal transportation in the U.S: 1970–2010. Technical report, University of Michigan Transportation Research Institute, Ann Arbor.Google Scholar
  • Stiglic M, Agatz N, Savelsbergh M, Gradisar M (2015) The benefits of meeting points in ride-sharing systems. Transportation Res. Part B 82:36–53.CrossrefGoogle Scholar
  • Stiglic M, Agatz N, Savelsbergh M, Gradisar M (2016) Making dynamic ride-sharing work: The impact of driver and rider flexibility. Transportation Res. Part E 91:190–207.CrossrefGoogle Scholar
  • Vande Vate JH (1989) Linear programming brings marital bliss. Oper. Res. Lett. 8(3):147–153.CrossrefGoogle Scholar
  • Wolfler Calvo R, de Luigi F, Haastrup P, Maniezzo V (2004) A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13):2263–2278.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.