Stable Matching for Dynamic Ride-Sharing Systems
暂无分享,去创建一个
[1] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[2] Martin W. P. Savelsbergh,et al. Making dynamic ride-sharing work: The impact of driver and rider flexibility , 2016 .
[3] J. V. Vate. Linear programming brings marital bliss , 1989 .
[4] Robert W. Irving. Stable Marriage and Indifference , 1994, Discret. Appl. Math..
[5] Andrew Amey. Proposed Methodology for Estimating Rideshare Viability Within an Organization: Application to the MIT Community , 2011 .
[6] Martin W. P. Savelsbergh,et al. Optimization for dynamic ride-sharing: A review , 2012, Eur. J. Oper. Res..
[7] N A McGuckin,et al. JOURNEY TO WORK IN THE UNITED STATES AND ITS MAJOR METROPOLITAN AREAS -- 1960 - 2000 , 2003 .
[8] A. Roth. A natural experiment in the organization of entry-level labor markets: regional markets for new physicians and surgeons in the United Kingdom. , 1991, The American economic review.
[9] Vittorio Maniezzo,et al. A distributed geographic information system for the daily car pooling problem , 2004, Comput. Oper. Res..
[10] Fernando Ordóñez,et al. Ridesharing: The state-of-the-art and future directions , 2013 .
[11] S. Clark,et al. The Uniqueness of Stable Matchings , 2006 .
[12] Roberto Baldacci,et al. An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation , 2004, Oper. Res..
[13] K. Iwama,et al. A Survey of the Stable Marriage Problem and Its Variants , 2008, International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008).
[14] Uriel G. Rothblum,et al. Characterization of stable matchings as extreme points of a polytope , 1992, Math. Program..
[15] Michael Sivak,et al. Effects of vehicle fuel economy, distance travelled, and vehicle load on the amount of fuel used for personal transportation: 1970-2010 , 2013 .
[16] Alvin E. Roth,et al. Stable Matchings, Optimal Assignments, and Linear Programming , 1993, Math. Oper. Res..
[17] David Manlove,et al. Hard variants of stable marriage , 2002, Theor. Comput. Sci..
[18] Martin W. P. Savelsbergh,et al. Dynamic ridesharing: Is there a role for dedicated drivers? , 2015 .
[19] L. Shapley,et al. College Admissions and the Stability of Marriage , 1962 .
[20] Robert W. Irving,et al. An efficient algorithm for the “optimal” stable marriage , 1987, JACM.
[21] Alistair J. Wilson,et al. Clearinghouses for two-sided matching: An experimental study , 2016 .
[22] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[23] Niels A. H. Agatz,et al. The Benefits of Meeting Points in Ride-Sharing Systems , 2015 .
[24] Elliot Anshelevich,et al. Anarchy, Stability, and Utopia: Creating Better Matchings , 2009, SAGT.
[25] Ali Haghani,et al. Real-Time Rideshare Matching Problem , 2010 .
[26] David Manlove,et al. Stable Marriage with Incomplete Lists and Ties , 1999, ICALP.
[27] L. S. Shapley,et al. 17. A Value for n-Person Games , 1953 .
[28] Niels A. H. Agatz,et al. The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .
[29] A. Roth. The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.
[30] A. Roth,et al. New physicians: a natural experiment in market organization , 1990, Science.
[31] A. Roth. What Have We Learned from Market Design? , 2008 .