mlsanityData to 14 Oct 2026

Real Time Bid Optimization with Smooth Budget Delivery in Online Advertising

arXiv 1305.3011 ↗First posted 14 May 2013cs.GT cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

Today, billions of display ad impressions are purchased on a daily basis through a public auction hosted by real time bidding (RTB) exchanges. A decision has to be made for advertisers to submit a bid for each selected RTB ad request in milliseconds. Restricted by the budget, the goal is to buy a set of ad impressions to reach as many targeted users as possible. A desired action (conversion), advertiser specific, includes purchasing a product, filling out a form, signing up for emails, etc. In addition, advertisers typically prefer to spend their budget smoothly over the time in order to reach a wider range of audience accessible throughout a day and have a sustainable impact. However, since the conversions occur rarely and the occurrence feedback is normally delayed, it is very challenging to achieve both budget and performance goals at the same time. In this paper, we present an online approach to the smooth budget delivery while optimizing for the conversion performance. Our algorithm tries to select high quality impressions and adjust the bid price based on the prior performance distribution in an adaptive manner by distributing the budget optimally across time. Our experimental results from real advertising campaigns demonstrate the effectiveness of our proposed approach.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 May 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 5; 2023: 0; 2024: 1; 2025: 5; 2026: 2.

13 papers.

Sort:

By area: