{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:53Z","timestamp":1750309313994,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Horizon 2020 Framework Programme","award":["ICT-48 research and innovation action under grant agreement 951847"],"award-info":[{"award-number":["ICT-48 research and innovation action under grant agreement 951847"]}]},{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["PNRR-PE-AI scheme (M4C2, investment 1.3, line on Artificial Intelligence)"],"award-info":[{"award-number":["PNRR-PE-AI scheme (M4C2, investment 1.3, line on Artificial Intelligence)"]}]},{"name":"European Research Council","award":["ERC Advanced Grant 788893 AMDROMA"],"award-info":[{"award-number":["ERC Advanced Grant 788893 AMDROMA"]}]},{"name":"Ministero dell'Universit\u00e0 e della Ricerca","award":["PNRR MUR project IR0000013-SoBigData.it"],"award-info":[{"award-number":["PNRR MUR project IR0000013-SoBigData.it"]}]},{"name":"University of Ottawa","award":["grant GR002837 (Start-Up Funds)"],"award-info":[{"award-number":["grant GR002837 (Start-Up Funds)"]}]},{"name":"Natural Sciences and Engineering Research Council of Canada","award":["RGPIN-2023-03688 (Discovery Grants Program) and DGECR-2023-00208 (Discovery Grants Program, DGECR - Discovery Launch Supplement)"],"award-info":[{"award-number":["RGPIN-2023-03688 (Discovery Grants Program) and DGECR-2023-00208 (Discovery Grants Program, DGECR - Discovery Launch Supplement)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,10]]},"DOI":"10.1145\/3618260.3649658","type":"proceedings-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T19:25:02Z","timestamp":1718133902000},"page":"225-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8477-4748","authenticated-orcid":false,"given":"Nicolo","family":"Cesa-Bianchi","sequence":"first","affiliation":[{"name":"University of Milan, Milan, Italy \/ Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5010-1094","authenticated-orcid":false,"given":"Tommaso","family":"Cesari","sequence":"additional","affiliation":[{"name":"University of Ottawa, Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9890-9543","authenticated-orcid":false,"given":"Roberto","family":"Colomboni","sequence":"additional","affiliation":[{"name":"University of Milan, Milan, Italy \/ Politecnico di Milano, Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6250-945X","authenticated-orcid":false,"given":"Federico","family":"Fusco","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9809-7191","authenticated-orcid":false,"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[{"name":"Sapienza University of Rome, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Proceedings of Machine Learning Research","first-page":"1769","volume-title":"ACML","author":"Achddou Juliette","unstructured":"Juliette Achddou, Olivier Capp\u00e9, and Aur\u00e9lien Garivier. Fast rate learning in stochastic first price bidding. In ACML, volume 157 of Proceedings of Machine Learning Research, pages 1754\u20131769. PMLR, 2021."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/140989455"},{"key":"e_1_3_2_1_3_1","volume-title":"COLT","author":"Audibert Jean-Yves","year":"2009","unstructured":"Jean-Yves Audibert and S\u00e9bastien Bubeck. Minimax policies for adversarial and stochastic bandits. In COLT, 2009."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1953023"},{"key":"e_1_3_2_1_5_1","first-page":"3497","volume-title":"WWW","author":"Badanidiyuru Ashwinkumar","unstructured":"Ashwinkumar Badanidiyuru, Zhe Feng, and Guru Guruganesh. Learning to bid in contextual first price auctions. In WWW, pages 3489\u20133497. ACM, 2023."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00064"},{"key":"e_1_3_2_1_7_1","volume-title":"NeurIPS","author":"Balseiro Santiago R.","year":"2019","unstructured":"Santiago R. Balseiro, Negin Golrezaei, Mohammad Mahdian, Vahab S. Mirrokni, and Jon Schneider. Contextual bandits with cross-learning. NeurIPS, 2019."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0663"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1257\/mic.20160278"},{"key":"e_1_3_2_1_10_1","volume-title":"STOC. ACM","author":"Bernasconi Martino","year":"2024","unstructured":"Martino Bernasconi, Matteo Castiglioni, Andrea Celli, and Federico Fusco. No-regret learning in bilateral trade via global budget balance. In STOC. ACM, 2024."},{"key":"e_1_3_2_1_11_1","volume-title":"Rolling out first price auctions to Google Ad Manager partners. https:\/\/www.blog.google\/products\/admanager\/rolling-out-first-price-auctions-google-ad-manager-partners\/","author":"Bigler Jason","year":"2019","unstructured":"Jason Bigler. Rolling out first price auctions to Google Ad Manager partners. https:\/\/www.blog.google\/products\/admanager\/rolling-out-first-price-auctions-google-ad-manager-partners\/, 2019. Accessed April 7, 2023."},{"key":"e_1_3_2_1_12_1","series-title":"Proceedings of Machine Learning Research","first-page":"1786","volume-title":"COLT","author":"Block Adam","unstructured":"Adam Block, Yuval Dagan, Noah Golowich, and Alexander Rakhlin. Smoothed online learning is as easy as statistical learning. In COLT, volume 178 of Proceedings of Machine Learning Research, pages 1716\u20131786. PMLR, 2022."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3635637.3662869"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467645"},{"key":"e_1_3_2_1_15_1","series-title":"Proceedings of Machine Learning Research","first-page":"1130","volume-title":"COLT","author":"Cesa-Bianchi Nicol\u00f2","unstructured":"Nicol\u00f2 Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi. Repeated bilateral trade against a smoothed adversary. In COLT, volume 195 of Proceedings of Machine Learning Research, pages 1095\u20131130. PMLR, 2023."},{"key":"e_1_3_2_1_16_1","volume-title":"The role of transparency in repeated first-price auctions with unknown valuations. CoRR, abs\/2307.09478","author":"Cesa-Bianchi Nicol\u00f2","year":"2023","unstructured":"Nicol\u00f2 Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, Federico Fusco, and Stefano Leonardi. The role of transparency in repeated first-price auctions with unknown valuations. CoRR, abs\/2307.09478, 2023."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2023.1351"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512059"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Nishanth Dikkala and \u00c9va Tardos. Can credit increase revenue? In WINE volume 8289 of Lecture Notes in Computer Science pages 121\u2013133. Springer 2013.","DOI":"10.1007\/978-3-642-45046-4_11"},{"key":"e_1_3_2_1_20_1","series-title":"Proceedings of Machine Learning Research","first-page":"8850","volume-title":"ICML","author":"Duetting Paul","unstructured":"Paul Duetting, Guru Guruganesh, Jon Schneider, and Joshua Ruizhi Wang. Optimal no-regret learning for one-sided lipschitz functions. In ICML, volume 202 of Proceedings of Machine Learning Research, pages 8836\u20138850. PMLR, 2023."},{"key":"e_1_3_2_1_21_1","first-page":"560","volume-title":"EC","author":"Durvasula Naveen","unstructured":"Naveen Durvasula, Nika Haghtalab, and Manolis Zampetakis. Smoothed analysis of online non-parametric auctions. In EC, pages 540\u2013560. ACM, 2023."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54110-4_10"},{"key":"e_1_3_2_1_23_1","first-page":"522","volume-title":"EC","author":"Feng Zhe","unstructured":"Zhe Feng, Chara Podimata, and Vasilis Syrgkanis. Learning to bid without knowing your value. In EC, pages 505\u2013522. ACM, 2018."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16680"},{"key":"e_1_3_2_1_25_1","volume-title":"NeurIPS","author":"Haghtalab Nika","year":"2020","unstructured":"Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty. Smoothed analysis of online and differentially private learning. In NeurIPS, 2020."},{"key":"e_1_3_2_1_26_1","first-page":"953","volume-title":"FOCS","author":"Haghtalab Nika","unstructured":"Nika Haghtalab, Tim Roughgarden, and Abhishek Shetty. Smoothed analysis with adaptive adversaries. In FOCS, pages 942\u2013953. IEEE, 2021."},{"key":"e_1_3_2_1_27_1","volume-title":"NeurIPS","author":"Haghtalab Nika","year":"2022","unstructured":"Nika Haghtalab, Yanjun Han, Abhishek Shetty, and Kunhe Yang. Oracle-efficient online learning for smoothed adversaries. In NeurIPS, 2022."},{"key":"e_1_3_2_1_28_1","volume-title":"Learning to bid optimally and efficiently in adversarial first-price auctions. arXiv preprint arXiv:2007.04568","author":"Han Yanjun","year":"2020","unstructured":"Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, and Tsachy Weissman. Learning to bid optimally and efficiently in adversarial first-price auctions. arXiv preprint arXiv:2007.04568, 2020."},{"key":"e_1_3_2_1_29_1","volume-title":"Optimal no-regret learning in repeated first-price auctions. arXiv preprint arXiv:2003.09795","author":"Han Yanjun","year":"2020","unstructured":"Yanjun Han, Zhengyuan Zhou, and Tsachy Weissman. Optimal no-regret learning in repeated first-price auctions. arXiv preprint arXiv:2003.09795, 2020."},{"key":"e_1_3_2_1_30_1","volume-title":"A smoothed analysis of the greedy algorithm for the linear contextual bandit problem. Advances in neural information processing systems, 31","author":"Kannan Sampath","year":"2018","unstructured":"Sampath Kannan, Jamie H Morgenstern, Aaron Roth, Bo Waggoner, and Zhiwei Steven Wu. A smoothed analysis of the greedy algorithm for the linear contextual bandit problem. Advances in neural information processing systems, 31, 2018."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299873"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512055"},{"key":"e_1_3_2_1_33_1","series-title":"Proceedings of Machine Learning Research","first-page":"1575","volume-title":"COLT","author":"Lattimore Tor","unstructured":"Tor Lattimore. Minimax regret for partial monitoring: Infinite outcomes and rustichini\u2019s regret. In COLT, volume 178 of Proceedings of Machine Learning Research, pages 1547\u20131575. PMLR, 2022."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_3_2_1_35_1","volume-title":"NIPS","author":"Rakhlin Alexander","year":"2011","unstructured":"Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari. Online learning: Stochastic, constrained, and smoothed adversaries. In NIPS, 2011."},{"key":"e_1_3_2_1_36_1","series-title":"Proceedings of Machine Learning Research","first-page":"3577","volume-title":"AISTATS","author":"Sharma Dravyansh","unstructured":"Dravyansh Sharma, Maria-Florina Balcan, and Travis Dick. Learning piecewise lipschitz functions in changing environments. In AISTATS, volume 108 of Proceedings of Machine Learning Research, pages 3567\u20133577. PMLR, 2020."},{"key":"e_1_3_2_1_37_1","volume-title":"Big changes coming to auctions, as exchanges roll the dice on first-price. https:\/\/adexchanger.com\/platforms\/big-changes-coming-auctions-exchanges-roll-dice-first-price\/","author":"Sluis Sarah","year":"2017","unstructured":"Sarah Sluis. Big changes coming to auctions, as exchanges roll the dice on first-price. https:\/\/adexchanger.com\/platforms\/big-changes-coming-auctions-exchanges-roll-dice-first-price\/, 2017. Accessed July 3, 2023."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990310"},{"key":"e_1_3_2_1_39_1","volume-title":"COLT","volume":"49","author":"Weed Jonathan","year":"2016","unstructured":"Jonathan Weed, Vianney Perchet, and Philippe Rigollet. Online learning in repeated auctions. In COLT, volume 49 of JMLR Workshop and Conference Proceedings, pages 1562\u20131583. JMLR.org, 2016."},{"key":"e_1_3_2_1_40_1","volume-title":"Moving AdSense to a first-price auction. https:\/\/blog.google\/products\/ads-commerce\/our-move-to-a-first-price-auction\/","author":"Wong Matt","year":"2021","unstructured":"Matt Wong. Moving AdSense to a first-price auction. https:\/\/blog.google\/products\/ads-commerce\/our-move-to-a-first-price-auction\/, 2021. Accessed July 6, 2023."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467113"},{"key":"e_1_3_2_1_42_1","volume-title":"NeurIPS","author":"Zhang Wei","year":"2022","unstructured":"Wei Zhang, Yanjun Han, Zhengyuan Zhou, Aaron Flores, and Tsachy Weissman. Leveraging the hints: Adaptive bidding in repeated first-price auctions. NeurIPS, 2022."}],"event":{"name":"STOC '24: 56th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Vancouver BC Canada","acronym":"STOC '24"},"container-title":["Proceedings of the 56th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649658","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618260.3649658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:51Z","timestamp":1750291431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":42,"alternative-id":["10.1145\/3618260.3649658","10.1145\/3618260"],"URL":"https:\/\/doi.org\/10.1145\/3618260.3649658","relation":{},"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2024-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}