{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:52Z","timestamp":1750309252201,"version":"3.41.0"},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"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":[[2024,2,22]]},"abstract":"<jats:p>This paper studies an online path selection problem and proposes online mechanisms for a network operator to sequentially update link prices. The aim is to incentivize online-arriving agents to join the network and select paths in a manner that maximizes the social welfare, which comprises both system profit and the quality of service experienced by agents. Competitive analysis is adopted to analyze the performance of the proposed online mechanism, whose best achievable competitive ratio is 4. Sufficient and necessary conditions on a competitive mechanism are established. Moreover, the performance limit of the celebrated multiplethe- index pricing scheme is also analyzed.<\/jats:p>","DOI":"10.1145\/3649477.3649498","type":"journal-article","created":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T23:05:43Z","timestamp":1708729543000},"page":"66-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Competitive Online Path-Aware Path Selection"],"prefix":"10.1145","volume":"51","author":[{"given":"Ying","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siyuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoqi","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"H.K. Tsang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,2,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085591"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453953.3453956"},{"key":"e_1_2_1_3_1","volume-title":"Internet-Draft draft-irtf-panrg-what-not-to-do-00","author":"Dawkins S.","year":"2020","unstructured":"S. Dawkins, \"Path aware networking: Obstacles to deployment (a bestiary of roads not taken),\" in Internet Engineering Task Force, Internet-Draft draft-irtf-panrg-what-not-to-do-00, 2020."},{"issue":"1","key":"e_1_2_1_4_1","first-page":"2","article-title":"Design of price mechanisms for network resource allocation via price of anarchy","volume":"131","author":"Chen Y.-J.","year":"2012","unstructured":"Y.-J. Chen and J. Zhang, \"Design of price mechanisms for network resource allocation via price of anarchy,\" Mathematical Programming, vol. 131, no. 1--2, pp. 333--364, 2012.","journal-title":"Mathematical Programming"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392142"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491042"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2971810"},{"key":"e_1_2_1_8_1","first-page":"32","volume-title":"Throughput-competitive on-line routing,\" in Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","author":"Awerbuch B.","year":"1993","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin, \"Throughput-competitive on-line routing,\" in Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 32--40, IEEE, 1993."},{"key":"e_1_2_1_9_1","first-page":"77","volume-title":"Welfare and profit maximization with production costs,\" in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","author":"Blum A.","year":"2011","unstructured":"A. Blum, A. Gupta, Y. Mansour, and A. Sharma, \"Welfare and profit maximization with production costs,\" in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 77--86, 2011."},{"issue":"2","key":"e_1_2_1_10_1","first-page":"3","article-title":"The design of competitive online algorithms via a primal--dual approach","volume":"3","author":"Buchbinder N.","year":"2009","unstructured":"N. Buchbinder, J. S. Naor, et al., \"The design of competitive online algorithms via a primal--dual approach,\" Foundations and Trends R- in Theoretical Computer Science, vol. 3, no. 2--3, pp. 93--263, 2009.","journal-title":"Foundations and Trends R- in Theoretical Computer Science"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2018.03.003"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649477.3649498","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649477.3649498","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:56:53Z","timestamp":1750291013000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649477.3649498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,2,22]]}},"alternative-id":["10.1145\/3649477.3649498"],"URL":"https:\/\/doi.org\/10.1145\/3649477.3649498","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"2024-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}