{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:30Z","timestamp":1772164110647,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["1826320, 2019844, 2112471"],"award-info":[{"award-number":["1826320, 2019844, 2112471"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-19-1-2566"],"award-info":[{"award-number":["N00014-19-1-2566"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wireless Networking and Communications Group (WNCG) Industrial Affiliates Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,6]]},"DOI":"10.1145\/3489048.3530960","type":"proceedings-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T10:30:55Z","timestamp":1654165855000},"page":"111-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Learning To Maximize Welfare with a Reusable Resource"],"prefix":"10.1145","author":[{"given":"Matthew","family":"Faw","sequence":"first","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Orestis","family":"Papadigenopoulos","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Constantine","family":"Caramanis","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]},{"given":"Sanjay","family":"Shakkottai","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Herbert Ellis Robbins, and David Siegmund","author":"Chow Yuan Shih","year":"1971","unstructured":"Yuan Shih Chow , Herbert Ellis Robbins, and David Siegmund . 1971 . Great expectations: The theory of optimal stopping. Yuan Shih Chow, Herbert Ellis Robbins, and David Siegmund. 1971. Great expectations: The theory of optimal stopping."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_53"},{"key":"e_1_3_2_1_3_1","volume-title":"Think eternally: Improved algorithms for the temp secretary problem and extensions. arXiv preprint arXiv:1606.06926","author":"Kesselheim Thomas","year":"2016","unstructured":"Thomas Kesselheim and Andreas T\u00f6nnis . 2016. Think eternally: Improved algorithms for the temp secretary problem and extensions. arXiv preprint arXiv:1606.06926 ( 2016 ). Thomas Kesselheim and Andreas T\u00f6nnis. 2016. Think eternally: Improved algorithms for the temp secretary problem and extensions. arXiv preprint arXiv:1606.06926 (2016)."},{"key":"e_1_3_2_1_4_1","volume-title":"On semiamarts, amarts, and processes with finite value. Probability on Banach Spaces (01","author":"Krengel Ulrich","year":"1978","unstructured":"Ulrich Krengel and Louis Sucheston . 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach Spaces (01 1978 ), 197--266. Ulrich Krengel and Louis Sucheston. 1978. On semiamarts, amarts, and processes with finite value. Probability on Banach Spaces (01 1978), 197--266."},{"key":"e_1_3_2_1_5_1","volume-title":"Bandit Algorithms","author":"Lattimore Tor","unstructured":"Tor Lattimore and Csaba Szepesv\u00e1ri . 2020. Bandit Algorithms . Cambridge University Press . https:\/\/doi.org\/10.1017\/9781108571401 10.1017\/9781108571401 Tor Lattimore and Csaba Szepesv\u00e1ri. 2020. Bandit Algorithms. Cambridge University Press. https:\/\/doi.org\/10.1017\/9781108571401"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176993150"},{"key":"e_1_3_2_1_7_1","volume-title":"Optimal stopping rules","author":"Shiryaev Albert N","unstructured":"Albert N Shiryaev . 2007. Optimal stopping rules . Vol. 8 . Springer Science & Business Media . Albert N Shiryaev. 2007. Optimal stopping rules. Vol. 8. Springer Science & Business Media."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376930.3376982"}],"event":{"name":"SIGMETRICS\/PERFORMANCE '22: ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Mumbai India","acronym":"SIGMETRICS\/PERFORMANCE '22","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstract Proceedings of the 2022 ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489048.3530960","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3489048.3530960","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489048.3530960","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489048.3530960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:02:26Z","timestamp":1750172546000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489048.3530960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,6]]},"references-count":8,"alternative-id":["10.1145\/3489048.3530960","10.1145\/3489048"],"URL":"https:\/\/doi.org\/10.1145\/3489048.3530960","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3547353.3530960","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2022,6,6]]},"assertion":[{"value":"2022-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}