{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T07:17:04Z","timestamp":1757575024737,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NWO Open Technology Program","award":["18938"],"award-info":[{"award-number":["18938"]}]},{"name":"Gravitation Project NETWORKS","award":["024.002.003"],"award-info":[{"award-number":["024.002.003"]}]},{"name":"Marie Sk?odowska-Cure Grant Agreement","award":["01034253"],"award-info":[{"award-number":["01034253"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673578","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"1134-1154","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5739-1178","authenticated-orcid":false,"given":"Riccardo","family":"Colini-Baldeschi","sequence":"first","affiliation":[{"name":"Central Applied Science, Meta, London, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2375-5313","authenticated-orcid":false,"given":"Sophie","family":"Klumper","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands"},{"name":"Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Amsterdam, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1923-4902","authenticated-orcid":false,"given":"Guido","family":"Sch\u00e4fer","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands"},{"name":"Institute for Logic, Language and Computation (ILLC), University of Amsterdam, Amsterdam, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5924-3620","authenticated-orcid":false,"given":"Artem","family":"Tsikiridis","sequence":"additional","affiliation":[{"name":"Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1228515"},{"key":"e_1_3_2_1_2_1","volume-title":"Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. Mathematics of Operations Research","author":"Agrawal Priyank","year":"2023","unstructured":"Priyank Agrawal, Eric Balkanski, Vasilis Gkatzelis, Tingting Ou, and Xizhi Tan. 2023. Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location. Mathematics of Operations Research (2023)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3582689"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2023.100778"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451023"},{"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":"Strategyproof Scheduling with Predictions. In 14th Innovations in Theoretical Computer Science Conference (ITCS","volume":"251","author":"Balkanski Eric","year":"2023","unstructured":"Eric Balkanski, Vasilis Gkatzelis, and Xizhi Tan. 2023a. Strategyproof Scheduling with Predictions. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), Vol. 251. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 11."},{"key":"e_1_3_2_1_8_1","volume-title":"Online Mechanism Design with Predictions. arXiv preprint arXiv:2310.02879","author":"Balkanski Eric","year":"2023","unstructured":"Eric Balkanski, Vasilis Gkatzelis, Xizhi Tan, and Cherlin Zhu. 2023b. Online Mechanism Design with Predictions. arXiv preprint arXiv:2310.02879 (2023)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.1"},{"key":"e_1_3_2_1_10_1","volume-title":"Optimal Metric Distortion with Predictions. arXiv preprint arXiv:2307.07495","author":"Berger Ben","year":"2023","unstructured":"Ben Berger, Michal Feldman, Vasilis Gkatzelis, and Xizhi Tan. 2023. Optimal Metric Distortion with Predictions. arXiv preprint arXiv:2307.07495 (2023)."},{"key":"e_1_3_2_1_11_1","volume-title":"Randomized learning-augmented auctions with revenue guarantees. arXiv preprint arXiv:2401.13384","author":"Caragiannis Ioannis","year":"2024","unstructured":"Ioannis Caragiannis and Georgios Kalantzis. 2024. Randomized learning-augmented auctions with revenue guarantees. arXiv preprint arXiv:2401.13384 (2024)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1958033.1958038"},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Machine Learning. PMLR, 3583--3602","author":"Chen Justin","year":"2022","unstructured":"Justin Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang. 2022. Faster fundamental graph algorithms via learned predictions. In International Conference on Machine Learning. PMLR, 3583--3602."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0625"},{"key":"e_1_3_2_1_15_1","volume-title":"To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model. arXiv preprint arXiv:2403.03725","author":"Colini-Baldeschi Riccardo","year":"2024","unstructured":"Riccardo Colini-Baldeschi, Sophie Klumper, Guido Sch\u00e4fer, and Artem Tsikiridis. 2024. To Trust or Not to Trust: Assignment Mechanisms with Predictions in the Private Graph Model. arXiv preprint arXiv:2403.03725 (2024)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009894503716"},{"key":"e_1_3_2_1_17_1","volume-title":"Faster matchings via learned duals. Advances in neural information processing systems 34","author":"Dinitz Michael","year":"2021","unstructured":"Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. 2021. Faster matchings via learned duals. Advances in neural information processing systems 34 (2021), 10393--10406."},{"key":"e_1_3_2_1_18_1","volume-title":"Algorithms with prediction portfolios. Advances in neural information processing systems 35","author":"Dinitz Michael","year":"2022","unstructured":"Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, and Sergei Vassilvitskii. 2022. Algorithms with prediction portfolios. Advances in neural information processing systems 35 (2022), 20273--20286."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807342.1807394"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2016.12.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105787"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.14"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1962.11989827"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538296"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1257\/0002828054825466"},{"key":"e_1_3_2_1_26_1","volume-title":"Mechanism Design With Predictions for Obnoxious Facility Location. arXiv preprint arXiv:2212.09521","author":"Istrate Gabriel","year":"2022","unstructured":"Gabriel Istrate and Cosmin Bonchis. 2022. Mechanism Design With Predictions for Obnoxious Facility Location. arXiv preprint arXiv:2212.09521 (2022)."},{"key":"e_1_3_2_1_27_1","first-page":"14555","article-title":"Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model","volume":"35","author":"Jin Billy","year":"2022","unstructured":"Billy Jin and Will Ma. 2022. Online bipartite matching with advice: Tight robustness-consistency tradeoffs for the two-stage model. Advances in Neural Information Processing Systems 35 (2022), 14555--14567.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_28_1","volume-title":"Flows and Load Balancing. In 29th Annual European Symposium on Algorithms (ESA","volume":"204","author":"Lavastida Thomas","year":"2021","unstructured":"Thomas Lavastida, Benjamin Moseley, R Ravi, and Chenyang Xu. 2021a. Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. In 29th Annual European Symposium on Algorithms (ESA 2021), Vol. 204. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 59."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976830.3"},{"key":"e_1_3_2_1_30_1","volume-title":"Competitive Auctions with Imperfect Predictions. arXiv preprint arXiv:2309.15414","author":"Lu Pinyan","year":"2023","unstructured":"Pinyan Lu, Zongqi Wan, and Jialin Zhang. 2023. Competitive Auctions with Imperfect Predictions. arXiv preprint arXiv:2309.15414 (2023)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"e_1_3_2_1_32_1","volume-title":"Algorithms with Predictions. arXiv preprint arXiv:2006.09123","author":"Mitzenmacher Michael","year":"2020","unstructured":"Michael Mitzenmacher and Sergei Vassilvitskii. 2020. Algorithms with Predictions. arXiv preprint arXiv:2006.09123 (2020)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.05.006"},{"key":"e_1_3_2_1_34_1","volume-title":"Bicriteria Multidimensional Mechanism Design with Side Information. Advances in Neural Information Processing Systems 36","author":"Prasad Siddharth","year":"2024","unstructured":"Siddharth Prasad, Maria-Florina F Balcan, and Tuomas Sandholm. 2024. Bicriteria Multidimensional Mechanism Design with Side Information. Advances in Neural Information Processing Systems 36 (2024)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2542174.2542175"},{"key":"e_1_3_2_1_36_1","volume-title":"Improving online algorithms via ML predictions. Advances in Neural Information Processing Systems 31","author":"Purohit Manish","year":"2018","unstructured":"Manish Purohit, Zoya Svitkina, and Ravi Kumar. 2018. Improving online algorithms via ML predictions. Advances in Neural Information Processing Systems 31 (2018)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.7.4.617"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1785414.1785439"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3232535"},{"key":"e_1_3_2_1_40_1","first-page":"20988","article-title":"Discrete-convex-analysis-based framework for warm-starting algorithms with predictions","volume":"35","author":"Sakaue Shinsaku","year":"2022","unstructured":"Shinsaku Sakaue and Taihei Oki. 2022. Discrete-convex-analysis-based framework for warm-starting algorithms with predictions. Advances in Neural Information Processing Systems 35 (2022), 20988--21000.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_41_1","volume-title":"Mechanism design without money. Algorithmic game theory 10","author":"Schummer James","year":"2007","unstructured":"James Schummer and Rakesh V Vohra. 2007. Mechanism design without money. Algorithmic game theory 10 (2007), 243--299."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/81"}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"New Haven CT USA","acronym":"EC '24"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673578","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:00Z","timestamp":1750295400000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":42,"alternative-id":["10.1145\/3670865.3673578","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673578","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"}}]}}