Real-time Bidding Strategy in Display Advertising: An Empirical Analysis
Mengjuan Liu, Zhengning Hu, Zhi Lai, Daiwei Zheng, Xuyun Nie
TL;DR
This work empirically analyzes real-time bidding strategies for display advertising, focusing on reinforcement learning approaches. It formalizes the bidding problem as an episodic MDP and compares model-based (RLB) and model-free (DRLB, FAB) strategies on the iPinYou dataset, highlighting how state, action, and reward choices shape performance. Results show model-free, continuous-action methods (FAB) outperform static baselines and other RL variants, with reward design proving crucial. The authors distill practical guidelines for RL-based RTB systems and provide open-source code to support replication and further research.
Abstract
Bidding strategies that help advertisers determine bidding prices are receiving increasing attention as more and more ad impressions are sold through real-time bidding systems. This paper first describes the problem and challenges of optimizing bidding strategies for individual advertisers in real-time bidding display advertising. Then, several representative bidding strategies are introduced, especially the research advances and challenges of reinforcement learning-based bidding strategies. Further, we quantitatively evaluate the performance of several representative bidding strategies on the iPinYou dataset. Specifically, we examine the effects of state, action, and reward function on the performance of reinforcement learning-based bidding strategies. Finally, we summarize the general steps for optimizing bidding strategies using reinforcement learning algorithms and present our suggestions.
