Real Time Bid Optimization with Smooth Budget Delivery in Online Advertising
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
Citing papers per year: 2022: 5; 2023: 0; 2024: 1; 2025: 5; 2026: 2.
13 papers.
Sort:
By area:
- 2022Optimal Regularized Online Allocation by Adaptive Re-Solvingcited by 8
- 2022Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgetscited by 4
- 2022Dynamic Budget Throttling in Repeated Second-Price Auctionscited by 2
- 2025Online Bidding under RoS Constraints without Knowing the Valuecited by 2
- 2025BAT: Benchmark for Auto-bidding Taskcited by 2
- 2025Personalized Interpolation: Achieving Efficient Conversion Estimation with Flexible Optimization Windowscited by 1
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithmscited by 1
- 2022Functional Optimization Reinforcement Learning for Real-Time Biddingcited by 0
- 2022A Profit-Maximizing Strategy for Advertising on the e-Commerce Platformscited by 0
- 2024Online Non-Stationary Stochastic Quasar-Convex Optimizationcited by 0
- 2025Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationaritycited by 0
- 2026DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluationcited by 0
- 2026When Privacy Moves ML-Mediated Decisions On Device: Information and Incentive Misalignment in Auctions27 Sep 2026
- 2026DRIVE: Distributional and Retrieval-Augmented Bidding with Value Evaluation12 Jun 2026
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms22 Oct 2025
- 2025BAT: Benchmark for Auto-bidding Task13 May 2025
- 2025Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationarity5 May 2025
- 2025Online Bidding under RoS Constraints without Knowing the Value5 Mar 2025
- 2025Personalized Interpolation: Achieving Efficient Conversion Estimation with Flexible Optimization Windows23 Jan 2025
- 2024Online Non-Stationary Stochastic Quasar-Convex Optimization4 Jul 2024
- 2022A Profit-Maximizing Strategy for Advertising on the e-Commerce Platforms31 Oct 2022
- 2022Optimal Regularized Online Allocation by Adaptive Re-Solving1 Sep 2022
- 2022Dynamic Budget Throttling in Repeated Second-Price Auctions11 Jul 2022
- 2022Functional Optimization Reinforcement Learning for Real-Time Bidding25 Jun 2022
1 more
- 2022Optimal Regularized Online Allocation by Adaptive Re-Solvingcited by 8
- 2022Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgetscited by 4
- 2022Dynamic Budget Throttling in Repeated Second-Price Auctionscited by 2
- 2025Online Bidding under RoS Constraints without Knowing the Valuecited by 2
- 2025BAT: Benchmark for Auto-bidding Taskcited by 2
- 2025Personalized Interpolation: Achieving Efficient Conversion Estimation with Flexible Optimization Windowscited by 1
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithmscited by 1
- 2022Functional Optimization Reinforcement Learning for Real-Time Biddingcited by 0
- 2022A Profit-Maximizing Strategy for Advertising on the e-Commerce Platformscited by 0
- 2024Online Non-Stationary Stochastic Quasar-Convex Optimizationcited by 0
- 2025Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationaritycited by 0
- 2026When Privacy Moves ML-Mediated Decisions On Device: Information and Incentive Misalignment in Auctionscited by 0
- 2026When Privacy Moves ML-Mediated Decisions On Device: Information and Incentive Misalignment in Auctions27 Sep 2026
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms22 Oct 2025
- 2025BAT: Benchmark for Auto-bidding Task13 May 2025
- 2025Plan-Driven Adaptive Bidding for First-Price Auctions with Budget Constraints under Nonstationarity5 May 2025
- 2025Online Bidding under RoS Constraints without Knowing the Value5 Mar 2025
- 2025Personalized Interpolation: Achieving Efficient Conversion Estimation with Flexible Optimization Windows23 Jan 2025
- 2024Online Non-Stationary Stochastic Quasar-Convex Optimization4 Jul 2024
- 2022A Profit-Maximizing Strategy for Advertising on the e-Commerce Platforms31 Oct 2022
- 2022Optimal Regularized Online Allocation by Adaptive Re-Solving1 Sep 2022
- 2022Dynamic Budget Throttling in Repeated Second-Price Auctions11 Jul 2022
- 2022Functional Optimization Reinforcement Learning for Real-Time Bidding25 Jun 2022
- 2022Optimal Spend Rate Estimation and Pacing for Ad Campaigns with Budgets4 Feb 2022