Budget Constrained Bidding by Model-free Reinforcement Learning in Display Advertising

Abstract

Real-time bidding (RTB) is an important mechanism in online display advertising, where a proper bid for each page view plays an essential role for good marketing results. Budget constrained bidding is a typical scenario in RTB where the advertisers hope to maximize the total value of the winning impressions under a pre-set budget constraint. However, the optimal bidding strategy is hard to be derived due to the complexity and volatility of the auction environment. To address these challenges, in this paper, we formulate budget constrained bidding as a Markov Decision Process and propose a model-free reinforcement learning framework to resolve the optimization problem. Our analysis shows that the immediate reward from environment is misleading under a critical resource constraint. Therefore, we innovate a reward function design methodology for the reinforcement learning problems with constraints. Based on the new reward design, we employ a deep neural network to learn the appropriate reward so that the optimal policy can be learned effectively. Different from the prior model-based work, which suffers from the scalability problem, our framework is easy to be deployed in large-scale industrial applications. The experimental evaluations demonstrate the effectiveness of our framework on large-scale real datasets.

arXiv commentIn The 27th ACM International Conference on Information and Knowledge Management (CIKM 18), October 22-26, 2018, Torino, Italy. ACM, New York, NY, USA, 9 pages

References in corpus (2)

• Real-Time Bidding by Reinforcement Learning in Display Advertising
• Sequential Selection of Correlated Ads by POMDPs

Cited by in corpus (14)

• Deep reinforcement learning for search, recommendation, and online advertising: a survey
• Jointly Learning to Recommend and Advertise
• Bid Optimization by Multivariable Control in Display Advertising
• An Efficient Deep Distribution Network for Bid Shading in First-Price Auctions
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising
• Recurrent Neural Networks for Stochastic Control in Real-Time Bidding
• We Know What You Want: An Advertising Strategy Recommender System for Online Advertising
• ROI-Constrained Bidding via Curriculum-Guided Bayesian Reinforcement Learning
• Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learning
• RL-MPCA: A Reinforcement Learning Based Multi-Phase Computation Allocation Approach for Recommender Systems
• A Real-World Implementation of Unbiased Lift-based Bidding System
• Risk-Aware Bid Optimization for Online Display Advertisement
• Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions -- Theory and Algorithms
• Learning to Infer User Hidden States for Online Sequential Advertising