{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:08Z","timestamp":1750220708859,"version":"3.41.0"},"reference-count":3,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,12,4]],"date-time":"2019-12-04T00:00:00Z","timestamp":1575417600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2019,12,4]]},"abstract":"<jats:p>We study a general online resource allocation problem, where a provider sells multiple types of capacity-limited resources to heterogeneous customers that arrive in a sequential and arbitrary manner. The provider charges payment from customers who purchase a bundle of resources but must pay an increasing supply cost with respect to the total resource allocated. The goal is to maximize the social welfare, namely, the total valuation of customers for their purchased bundles, minus the total supply cost of the provider for all the resources that have been allocated. We adopt the competitive analysis framework and provide an optimal posted-pricing mechanism (PPM). Our PPM is optimal in the sense that no other online algorithms can achieve a better competitive ratio.<\/jats:p>","DOI":"10.1145\/3374888.3374893","type":"journal-article","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T14:07:24Z","timestamp":1575554844000},"page":"9-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Posted Prices for Online Resource Allocation with Supply Costs"],"prefix":"10.1145","volume":"47","author":[{"given":"Xiaoqi","family":"Tan","sequence":"first","affiliation":[{"name":"University of Toronto, Toronto , Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Leon-Garcia","sequence":"additional","affiliation":[{"name":"University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny H.K.","family":"Tsang","sequence":"additional","affiliation":[{"name":"HKUST, Clear Water Bay, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,12,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000057"},{"key":"e_1_2_1_2_1","volume-title":"USA","author":"Blum A.","year":"2011","unstructured":"A. Blum , A. Gupta , Y. Mansour , and A. Sharma , \" Welfare and profit maximization with production costs,\" in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), Washington, DC , USA , 2011 . A. Blum, A. Gupta, Y. Mansour, and A. Sharma, \"Welfare and profit maximization with production costs,\" in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), Washington, DC, USA, 2011."},{"key":"e_1_2_1_3_1","first-page":"59","volume-title":"USA","author":"Huang Z.","year":"2015","unstructured":"Z. Huang and A. Kim , \" Welfare maximization with production costs: A primal dual approach,\" in Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), Philadelphia, PA , USA , 2015 , pp. 59 -- 72 . Z. Huang and A. Kim, \"Welfare maximization with production costs: A primal dual approach,\" in Proceedings of the Twenty-sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), Philadelphia, PA, USA, 2015, pp. 59--72."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3374888.3374893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3374888.3374893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:08Z","timestamp":1750199588000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3374888.3374893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,4]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,12,4]]}},"alternative-id":["10.1145\/3374888.3374893"],"URL":"https:\/\/doi.org\/10.1145\/3374888.3374893","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2019,12,4]]},"assertion":[{"value":"2019-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}