{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,14]],"date-time":"2026-08-14T10:15:35Z","timestamp":1786702535366,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"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":[[2022,7,12]]},"DOI":"10.1145\/3490486.3538296","type":"proceedings-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T13:29:36Z","timestamp":1657718976000},"page":"529-557","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Improved Price of Anarchy via Predictions"],"prefix":"10.1145","author":[{"given":"Vasilis","family":"Gkatzelis","sequence":"first","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kostas","family":"Kollias","sequence":"additional","affiliation":[{"name":"Google Research, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alkmini","family":"Sgouritsa","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xizhi","family":"Tan","sequence":"additional","affiliation":[{"name":"Drexel University, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings (Lecture Notes in Computer Science), Leah Epstein and Paolo Ferragina (Eds.)","volume":"7501","author":"Abed Fidaa","year":"2012","unstructured":"Fidaa Abed and Chien-Chung Huang . 2012 . Preemptive Coordination Mechanisms for Unrelated Machines. In Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10--12, 2012 . Proceedings (Lecture Notes in Computer Science), Leah Epstein and Paolo Ferragina (Eds.) , Vol. 7501 . Springer, 12--23. Fidaa Abed and Chien-Chung Huang. 2012. Preemptive Coordination Mechanisms for Unrelated Machines. In Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10--12, 2012. Proceedings (Lecture Notes in Computer Science), Leah Epstein and Paolo Ferragina (Eds.), Vol. 7501. Springer, 12--23."},{"key":"e_1_3_2_1_2_1","volume-title":"Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. CoRR","author":"Agrawal Priyank","year":"2022","unstructured":"Priyank Agrawal , Eric Balkanski , Vasilis Gkatzelis , Tingting Ou , and Xizhi Tan . 2022. Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. CoRR , Vol. abs\/ 2204 .01120 ( 2022 ). Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, and Xizhi Tan. 2022. Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. CoRR, Vol. abs\/2204.01120 (2022)."},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18","volume":"119","author":"Anand Keerti","year":"2020","unstructured":"Keerti Anand , Rong Ge , and Debmalya Panigrahi . 2020 . Customizing ML Predictions for Online Algorithms . In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research) , Vol. 119 . PMLR, 303--313. Keerti Anand, Rong Ge, and Debmalya Panigrahi. 2020. Customizing ML Predictions for Online Algorithms. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research), Vol. 119. PMLR, 303--313."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/070680096"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3215755.3215757"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.3"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18","volume":"119","author":"Bhaskara Aditya","year":"2020","unstructured":"Aditya Bhaskara , Ashok Cutkosky , Ravi Kumar , and Manish Purohit . 2020 . Online Learning with Imperfect Hints . In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research) , Vol. 119 . PMLR, 822--831. Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, and Manish Purohit. 2020. Online Learning with Imperfect Hints. In Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13--18 July 2020, Virtual Event (Proceedings of Machine Learning Research), Vol. 119. PMLR, 822--831."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554811"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9411-6"},{"key":"e_1_3_2_1_10_1","volume-title":"The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013","author":"Bil\u00f2 Vittorio","year":"2013","unstructured":"Vittorio Bil\u00f2 , Michele Flammini , and Luca Moscardelli . 2013 b. The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 , 26--29 October, 2013, Berkeley, CA, USA. 638--647. Vittorio Bil\u00f2, Michele Flammini, and Luca Moscardelli. 2013b. The Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation Is Constant. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26--29 October, 2013, Berkeley, CA, USA. 638--647."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9650-6"},{"key":"e_1_3_2_1_12_1","volume-title":"WINE 2017, Bangalore, India, December 17--20, 2017, Proceedings (Lecture Notes in Computer Science), Nikhil R. Devanur and Pinyan Lu (Eds.)","volume":"10660","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), Nikhil R. Devanur and Pinyan Lu (Eds.) , Vol. 10660 . 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), Nikhil R. Devanur and Pinyan Lu (Eds.), Vol. 10660. Springer, 74--87."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9128-8"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958016.1958021"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2841229"},{"key":"e_1_3_2_1_16_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\u00e9ter 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\u00e9ter Bir\u00f3, Jason D. Hartline, Michael Ostrovsky, and Ariel D. Procaccia (Eds.). ACM, 81--107."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3033274.3085151"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.005"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9832-3"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9753-8"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1096694"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2013.03.011"},{"key":"e_1_3_2_1_23_1","volume-title":"WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings (Lecture Notes in Computer Science), Yang Cai and Adrian Vetta (Eds.)","volume":"10123","author":"Freeman Rupert","year":"2016","unstructured":"Rupert Freeman , Samuel Haney , and Debmalya Panigrahi . 2016 . On the Price of Stability of Undirected Multicast Games. In Web and Internet Economics - 12th International Conference , WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings (Lecture Notes in Computer Science), Yang Cai and Adrian Vetta (Eds.) , Vol. 10123 . Springer, 354--368. Rupert Freeman, Samuel Haney, and Debmalya Panigrahi. 2016. On the Price of Stability of Undirected Multicast Games. In Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11--14, 2016, Proceedings (Lecture Notes in Computer Science), Yang Cai and Adrian Vetta (Eds.), Vol. 10123. Springer, 354--368."},{"key":"e_1_3_2_1_24_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Gairing Martin","unstructured":"Martin Gairing , Konstantinos Kollias , and Grammateia Kotsialou . 2015. Tight Bounds for Cost-Sharing in Weighted Congestion Games . In International Colloquium on Automata, Languages, and Programming . Springer , 626--637. Martin Gairing, Konstantinos Kollias, and Grammateia Kotsialou. 2015. Tight Bounds for Cost-Sharing in Weighted Congestion Games. In International Colloquium on Automata, Languages, and Programming. Springer, 626--637."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1512"},{"key":"e_1_3_2_1_26_1","volume-title":"Resource-Aware Cost-Sharing Mechanisms with Priors. In EC '21: The 22nd ACM Conference on Economics and Computation","author":"Gkatzelis Vasilis","year":"2021","unstructured":"Vasilis Gkatzelis , Emmanouil Pountourakis , and Alkmini Sgouritsa . 2021 . Resource-Aware Cost-Sharing Mechanisms with Priors. In EC '21: The 22nd ACM Conference on Economics and Computation , Budapest, Hungary, July 18--23 , 2021, P\u00e9 ter Bir\u00f3, Shuchi Chawla, and Federico Echenique (Eds.). ACM, 541--559. Vasilis Gkatzelis, Emmanouil Pountourakis, and Alkmini Sgouritsa. 2021. Resource-Aware Cost-Sharing Mechanisms with Priors. In EC '21: The 22nd ACM Conference on Economics and Computation, Budapest, Hungary, July 18--23, 2021, P\u00e9 ter Bir\u00f3, Shuchi Chawla, and Federico Echenique (Eds.). ACM, 541--559."},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15","volume":"97","author":"Gollapudi Sreenivas","year":"2019","unstructured":"Sreenivas Gollapudi and Debmalya Panigrahi . 2019 . Online Algorithms for Rent-Or-Buy with Expert Advice . In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.) , Vol. 97 . PMLR, 2319--2327. Sreenivas Gollapudi and Debmalya Panigrahi. 2019. Online Algorithms for Rent-Or-Buy with Expert Advice. In Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9--15 June 2019, Long Beach, California, USA (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.), Vol. 97. PMLR, 2319--2327."},{"key":"e_1_3_2_1_28_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_1_29_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming, ICALP 2018","author":"Harks Tobias","year":"2018","unstructured":"Tobias Harks , Martin Hoefer , Anja Huber , and Manuel Surek . 2018 . Efficient Black-Box Reductions for Separable Cost Sharing. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018 , July 9 --13 , 2018, Prague, Czech Republic (LIPIcs), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.), Vol. 107. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 154:1--154:15. Tobias Harks, Martin Hoefer, Anja Huber, and Manuel Surek. 2018. Efficient Black-Box Reductions for Separable Cost Sharing. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9--13, 2018, Prague, Czech Republic (LIPIcs), Ioannis Chatzigiannakis, Christos Kaklamanis, D\u00e1niel Marx, and Donald Sannella (Eds.), Vol. 107. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 154:1--154:15."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1110.0979"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.04.048"},{"key":"e_1_3_2_1_32_1","volume-title":"Learning-Based Frequency Estimation Algorithms. In 7th International Conference on Learning Representations, ICLR 2019","author":"Hsu Chen-Yu","year":"2019","unstructured":"Chen-Yu Hsu , Piotr Indyk , Dina Katabi , and Ali Vakilian . 2019 . Learning-Based Frequency Estimation Algorithms. In 7th International Conference on Learning Representations, ICLR 2019 , New Orleans, LA, USA, May 6--9 , 2019. OpenReview.net. Chen-Yu Hsu, Piotr Indyk, Dina Katabi, and Ali Vakilian. 2019. Learning-Based Frequency Estimation Algorithms. In 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6--9, 2019. OpenReview.net."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404033"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.032"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-012-9429-9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2781678"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2482540.2482562"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.04.015"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ICML 2018","volume":"80","author":"Lykouris Thodoris","year":"2018","unstructured":"Thodoris Lykouris and Sergei Vassilvitskii . 2018 . Competitive Caching with Machine Learned Advice . In Proceedings of the 35th International Conference on Machine Learning, ICML 2018 , Stockholmsmassan, Stockholm, Sweden, July 10--15 , 2018 (Proceedings of Machine Learning Research), Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80 . PMLR, 3302--3311. Thodoris Lykouris and Sergei Vassilvitskii. 2018. Competitive Caching with Machine Learned Advice. In Proceedings of the 35th International Conference on Machine Learning, ICML 2018, Stockholmsmassan, Stockholm, Sweden, July 10--15, 2018 (Proceedings of Machine Learning Research), Jennifer G. Dy and Andreas Krause (Eds.), Vol. 80. PMLR, 3302--3311."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1137"},{"key":"e_1_3_2_1_41_1","volume-title":"Revenue Optimization with Approximate Bid Predictions. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017","author":"Medina Andres Munoz","year":"2017","unstructured":"Andres Munoz Medina and Sergei Vassilvitskii . 2017 . Revenue Optimization with Approximate Bid Predictions. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017 , December 4 --9 , 2017, Long Beach, CA, USA, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett (Eds.). 1858--1866. Andres Munoz Medina and Sergei Vassilvitskii. 2017. Revenue Optimization with Approximate Bid Predictions. In Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4--9, 2017, Long Beach, CA, USA, Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett (Eds.). 1858--1866."},{"key":"e_1_3_2_1_42_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_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00199-007-0275-y"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_1_45_1","volume-title":"Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018","author":"Purohit Manish","year":"2018","unstructured":"Manish Purohit , Zoya Svitkina , and Ravi Kumar . 2018 . Improving Online Algorithms via ML Predictions . In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018 , NeurIPS 2018, December 3--8, 2018, Montr\u00e9al, Canada, Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicol\u00f2 Cesa-Bianchi, and Roman Garnett (Eds.). 9684--9693. Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving Online Algorithms via ML Predictions. In Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3--8, 2018, Montr\u00e9al, Canada, Samy Bengio, Hanna M. Wallach, Hugo Larochelle, Kristen Grauman, Nicol\u00f2 Cesa-Bianchi, and Roman Garnett (Eds.). 9684--9693."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0567"}],"event":{"name":"EC '22: The 23rd ACM Conference on Economics and Computation","location":"Boulder CO USA","acronym":"EC '22","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 23rd ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538296","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538296","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490486.3538296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:04Z","timestamp":1750188664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490486.3538296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":46,"alternative-id":["10.1145\/3490486.3538296","10.1145\/3490486"],"URL":"https:\/\/doi.org\/10.1145\/3490486.3538296","relation":{},"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"2022-07-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}