{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:30Z","timestamp":1750309350756,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":0,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"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":["CCF2209520","CCF2312156"],"award-info":[{"award-number":["CCF2209520","CCF2312156"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["437739576"],"award-info":[{"award-number":["437739576"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673471","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"278-278","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Optimum Online for Capacitated Resource Allocation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5944-2335","authenticated-orcid":false,"given":"Alexander","family":"Braun","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9420-9424","authenticated-orcid":false,"given":"Thomas","family":"Kesselheim","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8793-1531","authenticated-orcid":false,"given":"Tristan","family":"Pollner","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5255-4150","authenticated-orcid":false,"given":"Amin","family":"Saberi","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"event":{"sponsor":["SIGecom Special Interest Group on Economics and Computation"],"acronym":"EC '24","name":"EC '24: 25th ACM Conference on Economics and Computation","location":"New Haven CT USA"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673471","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673471","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":0,"alternative-id":["10.1145\/3670865.3673471","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673471","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}