Online joint bid/daily budget optimization of Internet advertising campaigns

DOI10.1016/J.ARTINT.2022.103663OpenAlexW3010048053MaRDI QIDQ2124437

Alessandro Nuara, Marcello Restelli, Francesco Trovò, Nicola Gatti

Publication date: 11 April 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.01452

zbMATH Keywords

Gaussian processesonline advertisingcombinatorial bandits

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

Online learning of network bottlenecks via minimax paths

Uses Software

• BayesDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
• Faces for a linear inequality in 0–1 variables
• The Multiple-Choice Knapsack Problem
• Budgeted Multi-Armed Bandit in Continuous Action Space
• Prediction, Learning, and Games

This page was built for publication: Online joint bid/daily budget optimization of Internet advertising campaigns