Search Conferences

Type in any word, words or author name. This searchs through the abstract title, keywords and abstract text and authors. You may search all conferences or just select one conference.

 All Conferences
 EMAC 2019 Annual Conference
 EMAC 2020 Annual Conference
 EMAC 2020 Regional Conference
 EMAC 2021 Annual Conference
 EMAC 2021 Regional Conference
 EMAC 2022 Annual
 EMAC 2022 Regional Conference
 EMAC 2023 Annual
 EMAC 2023 Regional Conference

EMAC 2022 Annual

Pacing in Real-Time Bidding for Online Display Advertising

Published: May 24, 2022


Ugurcan D√ľndar, WU Vienna; Nadia Abou Nabout, WU Vienna; Bernd Skiera, Goethe-University Frankfurt, Germany


When setting up real-time bidding campaigns, advertisers need to make a decision about how to allocate their budget over a day, which they refer to as pacing. In this paper, we analyze the profitability of two pacing heuristics used in practice. We benchmark them against a profit-maximizing pacing heuristic, which outperforms them when one can forecast hourly ad effectiveness perfectly. Yet, if predictions of hourly ad effectiveness are imperfect, the pacing heuristics used in practice might generate higher profits than the profit-maximizing pacing heuristic. To this end, we conduct two analyses: In a counterfactual analysis, we benchmark profitability of these pacing heuristics in three datasets from real RTB campaigns. Because the forecasting error in this analysis depends on the prediction models we use to forecast hourly ad effectiveness, we run a simulation study to understand when a specific pacing heuristic performs best by varying the forecasting errors on our predictions.