{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:53:12Z","timestamp":1783749192929,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T00:00:00Z","timestamp":1752969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"name":"NextGenerationEU PNRR-PE-AI","award":["M4C2"],"award-info":[{"award-number":["M4C2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,20]]},"DOI":"10.1145\/3690624.3709288","type":"proceedings-article","created":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T18:42:22Z","timestamp":1743792142000},"page":"73-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Safe Online Bid Optimization with Return on Investment and Budget Constraints"],"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\/0000-0002-6379-0260","authenticated-orcid":false,"given":"Alessandro","family":"Nuara","sequence":"additional","affiliation":[{"name":"ADcube, Milano, Italy and Politecnico di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2961-4538","authenticated-orcid":false,"given":"Giulia","family":"Romano","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2889-8903","authenticated-orcid":false,"given":"Giorgio","family":"Spadaro","sequence":"additional","affiliation":[{"name":"Politecnido di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5796-7667","authenticated-orcid":false,"given":"Francesco","family":"Trov\u00f2","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7349-3932","authenticated-orcid":false,"given":"Nicola","family":"Gatti","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,20]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"When Gaussian Processes Meet Combinatorial Bandits: GCB. In EWRL. 1--11","author":"Accabi G. M.","unstructured":"G. M. Accabi, F. Trov\u00f2, A. Nuara, N. Gatti, and M. Restelli. 2018. When Gaussian Processes Meet Combinatorial Bandits: GCB. In EWRL. 1--11."},{"key":"e_1_3_2_2_2_1","unstructured":"S. Amani M. Alizadeh and C. Thrampoulidis. 2020. Regret Bound for Safe Gaussian Process Bandit Optimization. In L4DC. 158--159."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3164539"},{"key":"e_1_3_2_2_4_1","unstructured":"Santiago Balseiro Haihao Lu and Vahab Mirrokni. 2020. Dual mirror descent for online allocation problems. In ICML. 613--628."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2018.3174"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"C. Borgs J. Chayes N. Immorlica K. Jain O. Etesami and M. Mahdian. 2007. Dynamics of bid optimization in online advertisement auctions. In WWW. 531--540.","DOI":"10.1145\/1242572.1242644"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884653"},{"key":"e_1_3_2_2_8_1","unstructured":"W. Chen Y. Wang and Y. Yuan. 2013. Combinatorial multi-armed bandit: General framework and applications. In ICML. 151--159."},{"key":"e_1_3_2_2_9_1","volume-title":"Jason Cheuk Nam Liang, and Vahab Mirrokni","author":"Deng Yuan","year":"2023","unstructured":"Yuan Deng, Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2023. Multi-channel autobidding with budget and roi constraints. In ICML. 7617--7644."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"N. R. Devanur and S. M. Kakade. 2009. The price of truthfulness for pay-per-click auctions. In ACM EC. 99--106.","DOI":"10.1145\/1566374.1566388"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"W. Ding T. Qin X.-D. Zhang and T.Y. Liu. 2013. Multi-Armed Bandit with Budget Constraint and Variable Costs. In AAAI. 232--238.","DOI":"10.1609\/aaai.v27i1.8637"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"J. Feldman S. Muthukrishnan M. Pal and C. Stein. 2007. Budget optimization in search-based advertising auctions. In EC. 40--49.","DOI":"10.1145\/1250910.1250917"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Zhe Feng Swati Padmanabhan and Di Wang. 2023. Online Bidding Algorithms for Return-on-Spend Constrained Advertisers. In WWW. 3550--3560.","DOI":"10.1145\/3543507.3583491"},{"key":"e_1_3_2_2_14_1","unstructured":"N. Galichet M. Sebag and O. Teytaud. 2013. Exploration vs exploitation vs safety: Risk-aware multi-armed bandits. In ACML. 245--260."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3761"},{"key":"e_1_3_2_2_16_1","volume-title":"Jason Cheuk Nam Liang, and Vahab Mirrokni","author":"Golrezaei Negin","year":"2021","unstructured":"Negin Golrezaei, Patrick Jaillet, Jason Cheuk Nam Liang, and Vahab Mirrokni. 2021a. Bidding and pricing in budget and roi constrained markets. arXiv preprint arXiv:2107.07725 (2021)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Negin Golrezaei Ilan Lobel and Renato Paes Leme. 2021b. Auction design for ROI-constrained buyers. In WWW. 3941--3952.","DOI":"10.1145\/3442381.3449841"},{"key":"e_1_3_2_2_18_1","unstructured":"A. Hans D. Schneega\u00df A. M. Sch\u00e4fer and S. Udluft. 2008. Safe exploration for reinforcement learning.. In ESANN. 143--148."},{"key":"e_1_3_2_2_19_1","volume-title":"Full year 2023 results. https:\/\/www.iab.com\/wp-content\/uploads\/2024\/04\/IAB_PwC_Internet_Ad_Revenue_Report2024.pdf. Online","author":"IAB.","year":"2024","unstructured":"IAB. 2024. Interactive Advertising Bureau (IAB) internet advertising revenue report, Full year 2023 results. https:\/\/www.iab.com\/wp-content\/uploads\/2024\/04\/IAB_PwC_Internet_Ad_Revenue_Report2024.pdf. Online; accessed 06 August 2024."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"D. Kong X. Fan K. Shmakov and J. Yang. 2018. A Combinational Optimization Approach for Advertising Budget Allocation. In WWW. 53--54.","DOI":"10.1145\/3184558.3186925"},{"key":"e_1_3_2_2_21_1","unstructured":"Brendan Lucier Sarath Pattathil Aleksandrs Slivkins and Mengxiao Zhang. 2024. Autobidders with budget and roi constraints: Efficiency regret and pacing dynamics. In ALT. 3642--3643."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1577069.1577089"},{"key":"e_1_3_2_2_23_1","unstructured":"A. Moradipari C. Thrampoulidis and M. Alizadeh. 2020. Stage-wise Conservative Linear Bandits. In NeurIPS. 11191--11201."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"A. Nuara N. Sosio F. Trov\u00f2 M. C. Zaccardi N. Gatti and M. Restelli. 2019. Dealing with Interdependencies and Uncertainty in Multi-Channel Advertising Campaigns Optimization. In WWW. 1376--1386.","DOI":"10.1145\/3308558.3313470"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"A. Nuara F. Trov\u00f2 N. Gatti and M. Restelli. 2018. A Combinatorial-Bandit Algorithm for the Online Joint Bid\/Budget Optimization of Pay-per-Click Advertising Campaigns. In AAAI. 2379--2386.","DOI":"10.1609\/aaai.v32i1.11888"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103663"},{"key":"e_1_3_2_2_27_1","unstructured":"M. Pirotta M. Restelli A. Pecorino and D. Calandriello. 2013. Safe policy iteration. In ICML. 307--315."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"C. E. Rasmussen and C. K. Williams. 2006. Gaussian processes for machine learning. Vol. 1. MIT Press.","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"e_1_3_2_2_29_1","unstructured":"Karthik Abinav Sankararaman and Aleksandrs Slivkins. 2018. Combinatorial semi-bandits with knapsacks. In AISTATS. 1760--1770."},{"key":"e_1_3_2_2_30_1","volume-title":"Bandit Setting: No Regret and Experimental Design. In ICML. 1015--1022.","author":"Srinivas N.","year":"2010","unstructured":"N. Srinivas, A. Krause, M. Seeger, and S. M. Kakade. 2010. Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design. In ICML. 1015--1022."},{"key":"e_1_3_2_2_31_1","unstructured":"Y. Sui A. Gotovos J. Burdick and A. Krause. 2015. Safe exploration for optimization with Gaussian processes. In ICML. 997--1005."},{"key":"e_1_3_2_2_32_1","volume-title":"Workshop on Sponsored Search Auctions","volume":"1","author":"Szymanski B. K.","unstructured":"B. K. Szymanski and J. Lee. 2006. Impact of roi on bidding and revenue in sponsored search advertisement auctions. In Workshop on Sponsored Search Auctions, Vol. 1. 1--8."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/2691107.2691119"},{"key":"e_1_3_2_2_34_1","unstructured":"F. Trov\u00f2 S. Paladino M. Restelli and N. Gatti. 2016. Budgeted Multi-Armed Bandit in Continuous Action Space. In ECAI. 560--568."},{"key":"e_1_3_2_2_35_1","unstructured":"V. V. Vazirani N. Nisan T. Roughgarden and E. Tardos. 2007. Algorithmic Game Theory. Cambridge University Press."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"crossref","unstructured":"W. Zhang Y. Zhang B. Gao Y. Yu X. Yuan and T.-Y. Liu. 2012. Joint optimization of bid and budget allocation in sponsored search. In SIGKDD. 1177--1185. gr","DOI":"10.1145\/2339530.2339716"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709288","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3690624.3709288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T15:38:35Z","timestamp":1755358715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3690624.3709288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":36,"alternative-id":["10.1145\/3690624.3709288","10.1145\/3690624"],"URL":"https:\/\/doi.org\/10.1145\/3690624.3709288","relation":{},"subject":[],"published":{"date-parts":[[2025,7,20]]},"assertion":[{"value":"2025-07-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}