{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:37:51Z","timestamp":1768315071554,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T00:00:00Z","timestamp":1626566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2047907"],"award-info":[{"award-number":["CCF-2047907"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,18]]},"DOI":"10.1145\/3465456.3467650","type":"proceedings-article","created":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T10:28:50Z","timestamp":1626604130000},"page":"541-559","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Resource-Aware Cost-Sharing Mechanisms with Priors"],"prefix":"10.1145","author":[{"given":"Vasilis","family":"Gkatzelis","sequence":"first","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanouil","family":"Pountourakis","sequence":"additional","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alkmini","family":"Sgouritsa","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_3"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215755.3215757"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554811"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9650-6"},{"key":"e_1_3_2_2_6_1","volume-title":"WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings (Lecture Notes in Computer Science","volume":"87","author":"Caragiannis Ioannis","year":"2017","unstructured":"Ioannis Caragiannis , Vasilis Gkatzelis , and Cosimo Vinci . 2017 . Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling. In Web and Internet Economics - 13th International Conference , WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings (Lecture Notes in Computer Science , Vol. 10660), Nikhil R. Devanur and Pinyan Lu (Eds.). Springer, 74-- 87 . Ioannis Caragiannis, Vasilis Gkatzelis, and Cosimo Vinci. 2017. Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling. In Web and Internet Economics - 13th International Conference, WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings (Lecture Notes in Computer Science, Vol. 10660), Nikhil R. Devanur and Pinyan Lu (Eds.). Springer, 74--87."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958016.1958021"},{"key":"e_1_3_2_2_8_1","volume-title":"Resource-Aware Protocols for Network Cost-Sharing Games. In EC '20: The 21st ACM Conference on Economics and Computation","author":"Christodoulou George","year":"2020","unstructured":"George Christodoulou , Vasilis Gkatzelis , Mohamad Latifian , and Alkmini Sgouritsa . 2020 . Resource-Aware Protocols for Network Cost-Sharing Games. In EC '20: The 21st ACM Conference on Economics and Computation , Virtual Event, Hungary, July 13--17 , 2020, , P\u00e9 ter Bir\u00f3, Jason D. Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 81--107. George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian, and Alkmini Sgouritsa. 2020. Resource-Aware Protocols for Network Cost-Sharing Games. In EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13--17, 2020, , P\u00e9 ter Bir\u00f3, Jason D. Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 81--107."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085151"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.005"},{"key":"e_1_3_2_2_11_1","volume-title":"Designing cost-sharing methods for bayesian games. Theory of computing systems","author":"Christodoulou George","year":"2019","unstructured":"George Christodoulou , Stefano Leonardi , and Alkmini Sgouritsa . 2019. Designing cost-sharing methods for bayesian games. Theory of computing systems , Vol. 63 , 1 ( 2019 ), 4--25. George Christodoulou, Stefano Leonardi, and Alkmini Sgouritsa. 2019. Designing cost-sharing methods for bayesian games. Theory of computing systems, Vol. 63, 1 (2019), 4--25."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9753-8"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1096694"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.03.011"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1512"},{"key":"e_1_3_2_2_16_1","volume-title":"Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Mathematics of Operations Research","author":"Gopalakrishnan Ragavendran","year":"2014","unstructured":"Ragavendran Gopalakrishnan , Jason R. Marden , and Adam Wierman . 2014. Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Mathematics of Operations Research ( 2014 ). Ragavendran Gopalakrishnan, Jason R. Marden, and Adam Wierman. 2014. Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Mathematics of Operations Research (2014)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2020.1050"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0979"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.048"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.032"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9429-9"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1137"},{"key":"e_1_3_2_2_23_1","volume-title":"International Colloquium on Automata, Languages and Programming","author":"Mosk-Aoyama Damon","unstructured":"Damon Mosk-Aoyama and Tim Roughgarden . 2009. Worst-case efficiency analysis of queueing disciplines . In International Colloquium on Automata, Languages and Programming . Springer , 546--557. Damon Mosk-Aoyama and Tim Roughgarden. 2009. Worst-case efficiency analysis of queueing disciplines. In International Colloquium on Automata, Languages and Programming. Springer, 546--557."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003550050145"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-007-0275-y"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Noam Nisan Tim Roughgarden Eva Tardos and Vijay V. Vazirani (Eds.). 2007. Algorithmic Game Theory .Cambridge University Press.  Noam Nisan Tim Roughgarden Eva Tardos and Vijay V. Vazirani (Eds.). 2007. Algorithmic Game Theory .Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0567"}],"event":{"name":"EC '21: The 22nd ACM Conference on Economics and Computation","location":"Budapest Hungary","acronym":"EC '21","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 22nd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467650","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465456.3467650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465456.3467650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,18]]},"references-count":28,"alternative-id":["10.1145\/3465456.3467650","10.1145\/3465456"],"URL":"https:\/\/doi.org\/10.1145\/3465456.3467650","relation":{},"subject":[],"published":{"date-parts":[[2021,7,18]]},"assertion":[{"value":"2021-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}