Optimal Real-Time Bidding Frameworks Discussion
Not on the map. Why?
Abstract (arXiv)
This note is a complementary material for the solution of optimal real-time bidding function in paper "Optimal Real-Time Bidding for Display Advertising, KDD 2014", where the estimated cost is taken as the bid price, i.e., the upper bound of the true cost. Here we discuss a more general bid optimisation framework with various utility and cost functions.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 1; 2025: 2.
5 papers.
- 2025RTBAgent: A LLM-based Agent System for Real-Time Biddingcited by 14
- 2024Trajectory-wise Iterative Reinforcement Learning Framework for Auto-biddingcited by 9
- 2021We Know What You Want: An Advertising Strategy Recommender System for Online Advertisingcited by 5
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithmscited by 1
- 2022A Unified Framework for Campaign Performance Forecasting in Online Display Advertisingcited by 0
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms22 Oct 2025
- 2025RTBAgent: A LLM-based Agent System for Real-Time Bidding2 Feb 2025
- 2024Trajectory-wise Iterative Reinforcement Learning Framework for Auto-bidding23 Feb 2024
- 2022A Unified Framework for Campaign Performance Forecasting in Online Display Advertising24 Feb 2022
- 2021We Know What You Want: An Advertising Strategy Recommender System for Online Advertising25 May 2021