{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T15:03:36Z","timestamp":1779807816560,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","funder":[{"name":"National Science Foundation","award":["2045641"],"award-info":[{"award-number":["2045641"]}]},{"name":"National Science Foundation","award":["2325956"],"award-info":[{"award-number":["2325956"]}]},{"name":"National Science Foundation","award":["2512128"],"award-info":[{"award-number":["2512128"]}]},{"name":"National Science Foundation","award":["2533814"],"award-info":[{"award-number":["2533814"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,8]]},"DOI":"10.1145\/3801489.3806839","type":"proceedings-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T14:22:48Z","timestamp":1779805368000},"page":"1-3","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Allocate Reusable Resources under Stochastic Rewards and Durations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2858-0604","authenticated-orcid":false,"given":"Ativ","family":"Joshi","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-5016-4281","authenticated-orcid":false,"given":"Qingsong","family":"Liu","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9278-2254","authenticated-orcid":false,"given":"Mohammad","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0270"},{"key":"e_1_3_2_1_2_1","volume-title":"Great expectations: the theory of optimal stopping","author":"Chow YS","year":"1971","unstructured":"YS Chow, H Robbins, and D Siegmund. [n.d.]. Great expectations: the theory of optimal stopping, 1971. Boston (Mass.) ([n.d.])."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3456756"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3530893"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2020.0687"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2021.4134"},{"key":"e_1_3_2_1_7_1","volume-title":"Asymptotically optimal competitive ratio for online allocation of reusable resources. Operations Research","author":"Goyal Vineet","year":"2025","unstructured":"Vineet Goyal, Garud Iyengar, and Rajan Udwani. 2025. Asymptotically optimal competitive ratio for online allocation of reusable resources. Operations Research (2025)."},{"key":"e_1_3_2_1_8_1","volume-title":"Online reusable resource allocations with multi-class arrivals. Available at SSRN 4320423","author":"Huo Tianming","year":"2022","unstructured":"Tianming Huo and Wang Chi Cheung. 2022. Online reusable resource allocations with multi-class arrivals. Available at SSRN 4320423 (2022)."},{"key":"e_1_3_2_1_9_1","volume-title":"Online reusable resource assortment planning with customer-dependent usage durations. Available at SSRN 4504713","author":"Huo Tianming","year":"2023","unstructured":"Tianming Huo and Wang Chi Cheung. 2023. Online reusable resource assortment planning with customer-dependent usage durations. Available at SSRN 4504713 (2023)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1977-14378-4"},{"key":"e_1_3_2_1_11_1","volume-title":"Redesigning VolunteerMatch's Search Algorithm: Toward More Equitable Access to Volunteers. Available at SSRN 4497747","author":"Manshadi Vahideh","year":"2023","unstructured":"Vahideh Manshadi, Scott Rodilitz, Daniela Saban, and Akshaya Suresh. 2023. Redesigning VolunteerMatch's Search Algorithm: Toward More Equitable Access to Volunteers. Available at SSRN 4497747 (2023)."},{"key":"e_1_3_2_1_12_1","volume-title":"Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability","author":"Samuel-Cahn Ester","year":"1984","unstructured":"Ester Samuel-Cahn. 1984. Comparison of threshold stop rules and maximum for independent nonnegative random variables. the Annals of Probability (1984), 1213-1216."},{"key":"e_1_3_2_1_13_1","volume-title":"Optimal stopping rules","author":"Shiryaev Albert N","unstructured":"Albert N Shiryaev. 2008. Optimal stopping rules. Springer."},{"key":"e_1_3_2_1_14_1","first-page":"231","article-title":"Admission Control of Service Requests in High-Speed Networks","volume":"50","author":"Wu Cynara C.","year":"2001","unstructured":"Cynara C. Wu and Dimitri P. Bertsekas. 2001. Admission Control of Service Requests in High-Speed Networks. IEEE Transactions on Vehicular Technology 50, 1 (2001), 231-242.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2022.0429"},{"key":"e_1_3_2_1_16_1","volume-title":"Online resource allocation for reusable resources. arXiv preprint arXiv:2212.02855","author":"Zhang Xilin","year":"2022","unstructured":"Xilin Zhang and Wang Chi Cheung. 2022. Online resource allocation for reusable resources. arXiv preprint arXiv:2212.02855 (2022)."}],"event":{"name":"SIGMETRICS '26: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","location":"Ann Arbor MI USA","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstracts of the 2026 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T14:23:55Z","timestamp":1779805435000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3801489.3806839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,8]]},"references-count":16,"alternative-id":["10.1145\/3801489.3806839","10.1145\/3801489"],"URL":"https:\/\/doi.org\/10.1145\/3801489.3806839","relation":{},"subject":[],"published":{"date-parts":[[2026,6,8]]},"assertion":[{"value":"2026-06-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}