暂无分享,去创建一个
Itai Ashlagi | Amin Saberi | Patrick Jaillet | Maximilien Burq | Chinmoy Dutta | Chris Sholley | A. Saberi | I. Ashlagi | Patrick Jaillet | Maximilien Burq | Chinmoy Dutta | C. Sholley
[1] Mohammad Akbarpour,et al. Thickness and Information in Dynamic Matching Markets , 2018, Journal of Political Economy.
[2] Leeat Yariv,et al. Optimal Dynamic Matching , 2015, Theoretical Economics.
[3] Michael Ostrovsky,et al. Carpooling and the Economics of Self-Driving Cars , 2018, EC.
[4] Yashodhan Kanoria,et al. State Dependent Control of Closed Queueing Networks , 2018, PERV.
[5] Yuhao Zhang,et al. How to match when all vertices arrive online , 2018, STOC.
[6] Amy R. Ward,et al. Dynamic Matching for Real-Time Ridesharing , 2017, Stochastic Systems.
[7] Emilio Frazzoli,et al. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment , 2017, Proceedings of the National Academy of Sciences.
[8] Itai Ashlagi,et al. Min-Cost Bipartite Perfect Matching with Delays , 2017, APPROX-RANDOM.
[9] Itai Ashlagi,et al. On Matching and Thickness in Heterogeneous Dynamic Markets , 2016, EC.
[10] Shay Kutten,et al. Online matching: haste makes waste! , 2016, STOC.
[11] Marco Pavone,et al. Control of robotic mobility-on-demand systems: A queueing-theoretical perspective , 2014, Int. J. Robotics Res..
[12] Emilio Frazzoli,et al. Shared-Vehicle Mobility-on-Demand Systems: A Fleet Operator's Guide to Rebalancing Empty Vehicles , 2016 .
[13] Itai Ashlagi,et al. A dynamic model of barter exchange , 2015, SODA.
[14] Patrick Jaillet,et al. Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..
[15] Paolo Santi,et al. Supporting Information for Quantifying the Benefits of Vehicle Pooling with Shareability Networks Data Set and Pre-processing , 2022 .
[16] Aranyak Mehta,et al. Online Matching and Ad Allocation , 2013, Found. Trends Theor. Comput. Sci..
[17] Ariel D. Procaccia,et al. Failure-aware kidney exchange , 2013, EC '13.
[18] Emilio Frazzoli,et al. Robotic load balancing for mobility-on-demand systems , 2012, Int. J. Robotics Res..
[19] Amin Saberi,et al. Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.
[20] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.
[21] Jon Feldman,et al. Online Ad Assignment with Free Disposal , 2009, WINE.
[22] Aranyak Mehta,et al. Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[23] Aranyak Mehta,et al. Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.
[24] M. Utku Ünver,et al. Dynamic Kidney Exchange , 2007 .
[25] Aranyak Mehta,et al. AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[26] Fei Li,et al. An optimal online algorithm for packet scheduling with agreeable deadlines , 2005, SODA '05.
[27] Marek Chrobak,et al. Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs , 2004, STACS.
[28] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[29] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[30] D. Bertsekas. The auction algorithm: A distributed relaxation method for the assignment problem , 1988 .
[31] William Vickrey,et al. Pricing as a Tool in Coordination of Local Transportation , 1965 .