{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T07:19:48Z","timestamp":1784013588895,"version":"3.55.0"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T00:00:00Z","timestamp":1624233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CNS 1010789"],"award-info":[{"award-number":["CNS 1010789"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2021,9,30]]},"abstract":"<jats:p>\n            Bipartite-matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite-matching markets, where agents arrive over time and are dynamically matched to a known set of disposable resources. In this article, we propose a new model,\n            <jats:italic>Online Matching with (offline) Reusable Resources under Known Adversarial Distributions<\/jats:italic>\n            <jats:italic>(<\/jats:italic>\n            OM-RR-KAD\n            <jats:italic>)<\/jats:italic>\n            , in which resources on the offline side are\n            <jats:italic>reusable<\/jats:italic>\n            instead of disposable; that is, once matched, resources become available again at some point in the future. We show that our model is tractable by presenting an LP-based non-adaptive algorithm that achieves an online competitive ratio of \u00bd-\u03f5 for any given constant \u03f5 &gt; 0. We also show that no adaptive algorithm can achieve a ratio of \u00bd +\n            <jats:italic>o<\/jats:italic>\n            (1) based on the same benchmark LP. Through a data-driven analysis on a massive openly available dataset, we show our model is robust enough to capture the application of taxi dispatching services and ride-sharing systems. We also present heuristics that perform well in practice.\n          <\/jats:p>","DOI":"10.1145\/3456756","type":"journal-article","created":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T13:39:49Z","timestamp":1624282789000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Allocation Problems in Ride-sharing Platforms"],"prefix":"10.1145","volume":"9","author":[{"given":"John P.","family":"Dickerson","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karthik A.","family":"Sankararaman","sequence":"additional","affiliation":[{"name":"Facebook, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pan","family":"Xu","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Marek Adamczyk Fabrizio Grandoni and Joydeep Mukherjee. 2015. Improved approximation algorithms for stochastic matching. In ESA\u201915.  Marek Adamczyk Fabrizio Grandoni and Joydeep Mukherjee. 2015. Improved approximation algorithms for stochastic matching. In ESA\u201915.","DOI":"10.1007\/978-3-662-48350-3_1"},{"key":"e_1_2_1_2_1","volume-title":"Price-directed control of a closed logistics queueing network. Oper. Res. 55, 6","author":"Adelman Daniel","year":"2007","unstructured":"Daniel Adelman . 2007. Price-directed control of a closed logistics queueing network. Oper. Res. 55, 6 ( 2007 ). Daniel Adelman. 2007. Price-directed control of a closed logistics queueing network. Oper. Res. 55, 6 (2007)."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Mohammad Akbarpour Shengwu Li and Shayan Oveis Gharan. 2014. Dynamic matching market design. In EC\u201914.  Mohammad Akbarpour Shengwu Li and Shayan Oveis Gharan. 2014. Dynamic matching market design. In EC\u201914.","DOI":"10.2139\/ssrn.2394319"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2012. Online prophet-inequality matching with applications to ad allocation. In EC\u201912.  Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2012. Online prophet-inequality matching with applications to ad allocation. In EC\u201912.","DOI":"10.1145\/2229012.2229018"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2013. The online stochastic generalized assignment problem. In APPROX-RANDOM\u201913.  Saeed Alaei MohammadTaghi Hajiaghayi and Vahid Liaghat. 2013. The online stochastic generalized assignment problem. In APPROX-RANDOM\u201913.","DOI":"10.1007\/978-3-642-40328-6_2"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1644"},{"key":"e_1_2_1_7_1","volume-title":"Manshadi","author":"Ashlagi Itai","year":"2013","unstructured":"Itai Ashlagi , Patrick Jaillet , and Vahideh H . Manshadi . 2013 . Kidney exchange in dynamic sparse heterogenous pools. In EC\u2019 13. Itai Ashlagi, Patrick Jaillet, and Vahideh H. Manshadi. 2013. Kidney exchange in dynamic sparse heterogenous pools. In EC\u201913."},{"key":"e_1_2_1_8_1","first-page":"927","article-title":"On matching and thickness in heterogeneous dynamic markets","volume":"67","author":"Ashlagi Itai","year":"2017","unstructured":"Itai Ashlagi , Maximilien Burq , Patrick Jaillet , and Vahideh Manshadi . 2017 . On matching and thickness in heterogeneous dynamic markets . Operations Research 67 , 4 (2017), 927 \u2013 949 . https:\/\/doi.org\/10.1287\/opre.2018.1826 10.1287\/opre.2018.1826 Itai Ashlagi, Maximilien Burq, Patrick Jaillet, and Vahideh Manshadi. 2017. On matching and thickness in heterogeneous dynamic markets. Operations Research 67, 4 (2017), 927\u2013949. https:\/\/doi.org\/10.1287\/opre.2018.1826","journal-title":"Operations Research"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"e_1_2_1_10_1","volume-title":"Dynamic pricing in ridesharing platforms. ACM SIGecom Exch. 15, 1","author":"Banerjee Siddhartha","year":"2016","unstructured":"Siddhartha Banerjee , Ramesh Johari , and Carlos Riquelme . 2016. Dynamic pricing in ridesharing platforms. ACM SIGecom Exch. 15, 1 ( 2016 ). Siddhartha Banerjee, Ramesh Johari, and Carlos Riquelme. 2016. Dynamic pricing in ridesharing platforms. ACM SIGecom Exch. 15, 1 (2016)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Siddhartha Banerjee Daniel Freund and Thodoris Lykouris. 2017. Pricing and optimization in shared vehicle systems: An approximation framework. In EC\u201917.  Siddhartha Banerjee Daniel Freund and Thodoris Lykouris. 2017. Pricing and optimization in shared vehicle systems: An approximation framework. In EC\u201917.","DOI":"10.1145\/3033274.3085099"},{"key":"e_1_2_1_12_1","volume-title":"efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61, 1","author":"Bertsimas Dimitris","year":"2013","unstructured":"Dimitris Bertsimas , Vivek F. Farias , and Nikolaos Trichakis . 2013. Fairness , efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61, 1 ( 2013 ). Dimitris Bertsimas, Vivek F. Farias, and Nikolaos Trichakis. 2013. Fairness, efficiency, and flexibility in organ allocation for kidney transplantation. Oper. Res. 61, 1 (2013)."},{"key":"e_1_2_1_13_1","volume-title":"Empty-car routing in ridesharing systems. arXiv preprint arXiv:1609.07219","author":"Braverman Anton","year":"2016","unstructured":"Anton Braverman , Jim G. Dai , Xin Liu , and Lei Ying . 2016. Empty-car routing in ridesharing systems. arXiv preprint arXiv:1609.07219 ( 2016 ). Anton Braverman, Jim G. Dai, Xin Liu, and Lei Ying. 2016. Empty-car routing in ridesharing systems. arXiv preprint arXiv:1609.07219 (2016)."},{"key":"e_1_2_1_14_1","volume-title":"Aravind Srinivasan, and Pan Xu.","author":"Brubach Brian","year":"2016","unstructured":"Brian Brubach , Karthik Abinav Sankararaman , Aravind Srinivasan, and Pan Xu. 2016 . New algorithms, better bounds, and a novel model for online stochastic matching. In ESA\u2019 16. Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2016. New algorithms, better bounds, and a novel model for online stochastic matching. In ESA\u201916."},{"key":"e_1_2_1_15_1","volume-title":"Aravind Srinivasan, and Pan Xu.","author":"Brubach Brian","year":"2017","unstructured":"Brian Brubach , Karthik Abinav Sankararaman , Aravind Srinivasan, and Pan Xu. 2017 . Attenuate locally, win globally: An attenuation-based framework for online stochastic matching with timeouts. In AAMAS\u2019 17. Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2017. Attenuate locally, win globally: An attenuation-based framework for online stochastic matching with timeouts. In AAMAS\u201917."},{"key":"e_1_2_1_16_1","unstructured":"Niv Buchbinder Kamal Jain and Joseph Seffi Naor. 2007. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA\u201907.  Niv Buchbinder Kamal Jain and Joseph Seffi Naor. 2007. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA\u201907."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Juan Camilo Castillo Dan Knoepfle and Glen Weyl. 2017. Surge pricing solves the wild goose chase. In EC\u201917.  Juan Camilo Castillo Dan Knoepfle and Glen Weyl. 2017. Surge pricing solves the wild goose chase. In EC\u201917.","DOI":"10.1145\/3033274.3085098"},{"key":"e_1_2_1_18_1","volume-title":"Aravind Srinivasan, Yuhao Wan, and Pan Xu.","author":"Curry Michael","year":"2019","unstructured":"Michael Curry , John P. Dickerson , Karthik Abinav Sankararaman , Aravind Srinivasan, Yuhao Wan, and Pan Xu. 2019 . Mix and match: Markov chains and mixing times for matching in rideshare. In WINE\u201918. Springer , 129\u2013141. Michael Curry, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yuhao Wan, and Pan Xu. 2019. Mix and match: Markov chains and mixing times for matching in rideshare. In WINE\u201918. Springer, 129\u2013141."},{"key":"e_1_2_1_19_1","volume-title":"Wilkens","author":"Devanur Nikhil R.","year":"2011","unstructured":"Nikhil R. Devanur , Kamal Jain , Balasubramanian Sivan , and Christopher A . Wilkens . 2011 . Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In EC\u2019 11. Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, and Christopher A. Wilkens. 2011. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In EC\u201911."},{"key":"e_1_2_1_20_1","volume-title":"Dickerson and Tuomas Sandholm","author":"John","year":"2015","unstructured":"John P. Dickerson and Tuomas Sandholm . 2015 . FutureMatch: Combining human value judgments and machine learning to match in dynamic environments. In AAAI\u2019 15. John P. Dickerson and Tuomas Sandholm. 2015. FutureMatch: Combining human value judgments and machine learning to match in dynamic environments. In AAAI\u201915."},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jon Feldman Aranyak Mehta Vahab Mirrokni and S. Muthukrishnan. 2009. Online stochastic matching: Beating 1-1\/e. In FOCS\u201909.  Jon Feldman Aranyak Mehta Vahab Mirrokni and S. Muthukrishnan. 2009. Online stochastic matching: Beating 1-1\/e. In FOCS\u201909.","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Yiding Feng Rad Niazadeh and Amin Saberi. 2019. Linear programming based online policies for real-time assortment of reusable resources. Chicago Booth Research Paper No. 20-25. https:\/\/ssrn.com\/abstract=3421227.  Yiding Feng Rad Niazadeh and Amin Saberi. 2019. Linear programming based online policies for real-time assortment of reusable resources. Chicago Booth Research Paper No. 20-25. https:\/\/ssrn.com\/abstract=3421227.","DOI":"10.2139\/ssrn.3421227"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3176764.3176774"},{"key":"e_1_2_1_24_1","unstructured":"Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to adwords. In SODA\u201908.  Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to adwords. In SODA\u201908."},{"key":"e_1_2_1_25_1","volume-title":"Online allocation of reusable resources: Achieving optimal competitive ratio. arXiv preprint arXiv:2002.02430","author":"Goyal Vineet","year":"2020","unstructured":"Vineet Goyal , Garud Iyengar , and Rajan Udwani . 2020. Online allocation of reusable resources: Achieving optimal competitive ratio. arXiv preprint arXiv:2002.02430 ( 2020 ). Vineet Goyal, Garud Iyengar, and Rajan Udwani. 2020. Online allocation of reusable resources: Achieving optimal competitive ratio. arXiv preprint arXiv:2002.02430 (2020)."},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Bernhard Haeupler Vahab S. Mirrokni and Morteza Zadimoghaddam. 2011. Online stochastic weighted matching: Improved approximation algorithms. In WINE\u201911.  Bernhard Haeupler Vahab S. Mirrokni and Morteza Zadimoghaddam. 2011. Online stochastic weighted matching: Improved approximation algorithms. In WINE\u201911.","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"e_1_2_1_27_1","unstructured":"Chien-Ju Ho and Jennifer Wortman Vaughan. 2012. Online task assignment in crowdsourcing markets. In AAAI\u201912.  Chien-Ju Ho and Jennifer Wortman Vaughan. 2012. Online task assignment in crowdsourcing markets. In AAAI\u201912."},{"key":"e_1_2_1_28_1","volume-title":"Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39, 3","author":"Jaillet Patrick","year":"2013","unstructured":"Patrick Jaillet and Xin Lu. 2013. Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39, 3 ( 2013 ). Patrick Jaillet and Xin Lu. 2013. Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39, 3 (2013)."},{"key":"e_1_2_1_29_1","volume-title":"Vazirani","author":"Karp Richard M.","year":"1990","unstructured":"Richard M. Karp , Umesh V. Vazirani , and Vijay V . Vazirani . 1990 . An optimal algorithm for on-line bipartite matching. In STOC\u2019 90. Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In STOC\u201990."},{"key":"e_1_2_1_30_1","volume-title":"Taxi dispatch system based on current demands and real-time traffic conditions. Transport. Res. Rec.: J. Transport. Res. Board1882","author":"Lee Der-Horng","year":"2004","unstructured":"Der-Horng Lee , Hao Wang , Ruey Cheu , and Siew Teo . 2004. Taxi dispatch system based on current demands and real-time traffic conditions. Transport. Res. Rec.: J. Transport. Res. Board1882 ( 2004 ). Der-Horng Lee, Hao Wang, Ruey Cheu, and Siew Teo. 2004. Taxi dispatch system based on current demands and real-time traffic conditions. Transport. Res. Rec.: J. Transport. Res. Board1882 (2004)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Meghna Lowalekar Pradeep Varakantham and Patrick Jaillet. 2016. Online spatio-temporal matching in stochastic and dynamic domains. In AAAI\u201916.  Meghna Lowalekar Pradeep Varakantham and Patrick Jaillet. 2016. Online spatio-temporal matching in stochastic and dynamic domains. In AAAI\u201916.","DOI":"10.1609\/aaai.v30i1.10425"},{"key":"e_1_2_1_32_1","unstructured":"Meghna Lowalekar Pradeep Varakantham and Patrick Jaillet. 2020. Competitive ratios for online multi-capacity ridesharing. In AAMAS\u201920. 771\u2013779.  Meghna Lowalekar Pradeep Varakantham and Patrick Jaillet. 2020. Competitive ratios for online multi-capacity ridesharing. In AAMAS\u201920. 771\u2013779."},{"key":"e_1_2_1_33_1","volume-title":"Parkes","author":"Ma Hongyao","year":"2019","unstructured":"Hongyao Ma , Fei Fang , and David C . Parkes . 2019 . Spatio-temporal pricing for ridesharing platforms. In EC\u2019 19. 583\u2013583. Hongyao Ma, Fei Fang, and David C. Parkes. 2019. Spatio-temporal pricing for ridesharing platforms. In EC\u201919. 583\u2013583."},{"key":"e_1_2_1_34_1","unstructured":"Will Ma. 2014. Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms. In SODA\u201914.  Will Ma. 2014. Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms. In SODA\u201914."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs. In STOC\u201911.  Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs. In STOC\u201911.","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_2_1_36_1","volume-title":"Shayan Oveis Gharan, and Amin Saberi","author":"Manshadi Vahideh H.","year":"2012","unstructured":"Vahideh H. Manshadi , Shayan Oveis Gharan, and Amin Saberi . 2012 . Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res . 37, 4 (2012). Vahideh H. Manshadi, Shayan Oveis Gharan, and Amin Saberi. 2012. Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37, 4 (2012)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Nicholas Mattei Abdallah Saffidine and Toby Walsh. 2017. Mechanisms for online organ matching. In IJCAI\u201917.  Nicholas Mattei Abdallah Saffidine and Toby Walsh. 2017. Mechanisms for online organ matching. In IJCAI\u201917.","DOI":"10.24963\/ijcai.2017\/49"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Nicole Megow Marc Uetz and Tjark Vredeveld. 2004. Stochastic online scheduling on parallel machines. In WAOA\u201904.  Nicole Megow Marc Uetz and Tjark Vredeveld. 2004. Stochastic online scheduling on parallel machines. In WAOA\u201904.","DOI":"10.1007\/11389811_15"},{"key":"e_1_2_1_39_1","volume-title":"Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31, 3","author":"Megow Nicole","year":"2006","unstructured":"Nicole Megow , Marc Uetz , and Tjark Vredeveld . 2006. Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31, 3 ( 2006 ). Nicole Megow, Marc Uetz, and Tjark Vredeveld. 2006. Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31, 3 (2006)."},{"key":"e_1_2_1_40_1","volume-title":"Online matching and ad allocation. Theor. Comput. Sci. 8, 4","author":"Mehta Aranyak","year":"2012","unstructured":"Aranyak Mehta . 2012. Online matching and ad allocation. Theor. Comput. Sci. 8, 4 ( 2012 ). Aranyak Mehta. 2012. Online matching and ad allocation. Theor. Comput. Sci. 8, 4 (2012)."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_2_1_42_1","volume-title":"Cloud Computing: Web-based Applications that Change the Way You Work and Collaborate Online","author":"Miller Michael","year":"2008","unstructured":"Michael Miller . 2008 . Cloud Computing: Web-based Applications that Change the Way You Work and Collaborate Online . Que publishing. Michael Miller. 2008. Cloud Computing: Web-based Applications that Change the Way You Work and Collaborate Online. Que publishing."},{"key":"e_1_2_1_43_1","volume-title":"Global kidney disease. The Lancet 382, 9900","author":"Neuen Brendon L.","year":"2013","unstructured":"Brendon L. Neuen , Georgina E. Taylor , Alessandro R. Demaio , and Vlado Perkovic . 2013. Global kidney disease. The Lancet 382, 9900 ( 2013 ). Brendon L. Neuen, Georgina E. Taylor, Alessandro R. Demaio, and Vlado Perkovic. 2013. Global kidney disease. The Lancet 382, 9900 (2013)."},{"key":"e_1_2_1_45_1","volume-title":"Shmoys","author":"O\u2019Mahony Eoin","year":"2015","unstructured":"Eoin O\u2019Mahony and David B . Shmoys . 2015 . Data analysis and optimization for (citi) bike sharing. In AAAI\u2019 15. Eoin O\u2019Mahony and David B. Shmoys. 2015. Data analysis and optimization for (citi) bike sharing. In AAAI\u201915."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/stsy.2019.0037"},{"key":"e_1_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Jiang Rong Tao Qin and Bo An. 2018. Dynamic pricing for reusable resources in competitive market with stochastic demand. In AAAI\u201918.  Jiang Rong Tao Qin and Bo An. 2018. Dynamic pricing for reusable resources in competitive market with stochastic demand. In AAAI\u201918.","DOI":"10.1609\/aaai.v32i1.11591"},{"key":"e_1_2_1_48_1","volume-title":"Dynamic assortment optimization for reusable products with random usage durations. Manag. Sci. 66, 7","author":"Rusmevichientong Paat","year":"2020","unstructured":"Paat Rusmevichientong , Mika Sumida , and Huseyin Topaloglu . 2020. Dynamic assortment optimization for reusable products with random usage durations. Manag. Sci. 66, 7 ( 2020 ). Paat Rusmevichientong, Mika Sumida, and Huseyin Topaloglu. 2020. Dynamic assortment optimization for reusable products with random usage durations. Manag. Sci. 66, 7 (2020)."},{"key":"e_1_2_1_49_1","article-title":"US renal data system 2014 annual data report: Epidemiology of kidney disease in the United","volume":"65","author":"Saran Rajiv","year":"2015","unstructured":"Rajiv Saran , Yi Li , Bruce Robinson , John Ayanian , Rajesh Balkrishnan , Jennifer Bragg-Gresham , J. T. Chen , Elizabeth Cope , Debbie Gipson , Kevin He et \u00a0al . 2015 . US renal data system 2014 annual data report: Epidemiology of kidney disease in the United States.Amer. J. Kidn. Dis. 65 , 6 Suppl 1 (2015). Rajiv Saran, Yi Li, Bruce Robinson, John Ayanian, Rajesh Balkrishnan, Jennifer Bragg-Gresham, J. T. Chen, Elizabeth Cope, Debbie Gipson, Kevin He et\u00a0al. 2015. US renal data system 2014 annual data report: Epidemiology of kidney disease in the United States.Amer. J. Kidn. Dis. 65, 6 Suppl 1 (2015).","journal-title":"States.Amer. J. Kidn. Dis."},{"key":"e_1_2_1_50_1","article-title":"A collaborative multiagent taxi-dispatch system","volume":"7","author":"Seow Kiam Tian","year":"2010","unstructured":"Kiam Tian Seow , Nam Hai Dang , and Der-Horng Lee . 2010 . A collaborative multiagent taxi-dispatch system . IEEE Trans. Autom. Sci. Eng. 7 , 3 (2010). Kiam Tian Seow, Nam Hai Dang, and Der-Horng Lee. 2010. A collaborative multiagent taxi-dispatch system. IEEE Trans. Autom. Sci. Eng. 7, 3 (2010).","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"e_1_2_1_51_1","volume-title":"AAAI\u201915 Workshop on Computational Sustainability.","author":"Singhvi Divya","unstructured":"Divya Singhvi , Somya Singhvi , Peter I. Frazier , Shane G. Henderson , Eoin O\u2019Mahony , David B. Shmoys , and Dawn B. Woodard . 2015. Predicting bike usage for New York City\u2019s bike sharing system . In AAAI\u201915 Workshop on Computational Sustainability. Divya Singhvi, Somya Singhvi, Peter I. Frazier, Shane G. Henderson, Eoin O\u2019Mahony, David B. Shmoys, and Dawn B. Woodard. 2015. Predicting bike usage for New York City\u2019s bike sharing system. In AAAI\u201915 Workshop on Computational Sustainability."},{"key":"e_1_2_1_52_1","volume-title":"Unrelated machine scheduling with stochastic processing times. Math. Oper. Res. 41, 3","author":"Skutella Martin","year":"2016","unstructured":"Martin Skutella , Maxim Sviridenko , and Marc Uetz . 2016. Unrelated machine scheduling with stochastic processing times. Math. Oper. Res. 41, 3 ( 2016 ). Martin Skutella, Maxim Sviridenko, and Marc Uetz. 2016. Unrelated machine scheduling with stochastic processing times. Math. Oper. Res. 41, 3 (2016)."},{"key":"e_1_2_1_53_1","article-title":"Near optimal algorithms for online weighted bipartite matching in adversary model","volume":"34","author":"Sun Xiaoming","year":"2016","unstructured":"Xiaoming Sun , Jia Zhang , and Jialin Zhang . 2016 . Near optimal algorithms for online weighted bipartite matching in adversary model . J. Combin. Optim. 34 , 3 (2016). Xiaoming Sun, Jia Zhang, and Jialin Zhang. 2016. Near optimal algorithms for online weighted bipartite matching in adversary model. J. Combin. Optim. 34, 3 (2016).","journal-title":"J. Combin. Optim."},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Yong Sun Jun Wang and Wenan Tan. 2017. Online algorithms of task allocation in spatial crowdsourcing. In ICDE\u201917.  Yong Sun Jun Wang and Wenan Tan. 2017. Online algorithms of task allocation in spatial crowdsourcing. In ICDE\u201917.","DOI":"10.1145\/3127404.3127443"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Yongxin Tong Jieying She Bolin Ding Libin Wang and Lei Chen. 2016. Online mobile micro-task allocation in spatial crowdsourcing. In ICDE\u201916.  Yongxin Tong Jieying She Bolin Ding Libin Wang and Lei Chen. 2016. Online mobile micro-task allocation in spatial crowdsourcing. In ICDE\u201916.","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS\u201917)","author":"Verma Tanvi","year":"2017","unstructured":"Tanvi Verma , Pradeep Varakantham , Sarit Kraus , and Hoong Chuin Lau . 2017 . Augmenting decisions of taxi drivers through reinforcement learning for improving revenues . In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS\u201917) . 409\u2013417. Tanvi Verma, Pradeep Varakantham, Sarit Kraus, and Hoong Chuin Lau. 2017. Augmenting decisions of taxi drivers through reinforcement learning for improving revenues. In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS\u201917). 409\u2013417."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-014-0054-4"},{"key":"e_1_2_1_59_1","volume-title":"et\u00a0al","author":"Yiu Man Lung","year":"2008","unstructured":"Man Lung Yiu , Kyriakos Mouratidis , Nikos Mamoulis , et\u00a0al . 2008 . Capacity constrained assignment in spatial databases. In SIGMOD\u2019 08. Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis, et\u00a0al. 2008. Capacity constrained assignment in spatial databases. In SIGMOD\u201908."},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/GREENCOMP.2010.5598294"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3456756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3456756","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3456756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:26Z","timestamp":1750195886000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3456756"}},"subtitle":["Online Matching with Offline Reusable Resources"],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9,30]]}},"alternative-id":["10.1145\/3456756"],"URL":"https:\/\/doi.org\/10.1145\/3456756","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]},"assertion":[{"value":"2018-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}