{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:57:33Z","timestamp":1781031453389,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800845","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1353-1364","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Sample Complexity of Uniform Approximation for Multi-dimensional CDFs and Fixed-Price Mechanisms"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1070-6766","authenticated-orcid":false,"given":"Matteo","family":"Castiglioni","sequence":"first","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-2772-6508","authenticated-orcid":false,"given":"Anna","family":"Lunghi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8284-5757","authenticated-orcid":false,"given":"Alberto","family":"Marchesi","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673520"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104231"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3670865.3673463"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649653"},{"key":"e_1_3_2_1_5_1","volume-title":"Online optimization in X-armed bandits. Advances in Neural Information Processing Systems, 21","author":"Bubeck S\u00e9bastien","year":"2008","unstructured":"S\u00e9bastien Bubeck, Gilles Stoltz, Csaba Szepesv\u00e1ri, and R\u00e9mi Munos. 2008. Online optimization in X-armed bandits. Advances in Neural Information Processing Systems, 21 (2008)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Matteo Castiglioni Anna Lunghi and Alberto Marchesi. 2026. The Sample Complexity of Uniform Approximation for Multi-Dimensional CDFs and Fixed-Price Mechanisms. arXiv preprint arXiv:2602.10868 https:\/\/doi.org\/10.48550\/arXiv.2602.10868 10.48550\/arXiv.2602.10868","DOI":"10.48550\/arXiv.2602.10868"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.1351"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467645"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728174"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00083"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238232"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299873"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch17"},{"key":"e_1_3_2_1_14_1","unstructured":"Anna Lunghi Matteo Castiglioni and Alberto Marchesi. 2025. Online Two-Sided Markets: Many Buyers Enhance Learning. arXiv preprint arXiv:2503.01529."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978971.233"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Pascal Massart. 1990. The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality. The annals of Probability 1269\u20131283. https:\/\/doi.org\/10.1214\/aop\/1176990746 10.1214\/aop\/1176990746","DOI":"10.1214\/aop\/1176990746"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2021.109088"},{"key":"e_1_3_2_1_18_1","volume-title":"Multi-armed bandits on implicit metric spaces. Advances in Neural Information Processing Systems, 24","author":"Slivkins Aleksandrs","year":"2011","unstructured":"Aleksandrs Slivkins. 2011. Multi-armed bandits on implicit metric spaces. Advances in Neural Information Processing Systems, 24 (2011)."}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800845","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:05Z","timestamp":1781028245000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":18,"alternative-id":["10.1145\/3798129.3800845","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800845","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}