Optimal Allocation of Real-Time-Bidding and Direct Campaigns

2020-06-12 · Grégoire Jauvion, Nicolas Grislain

In this paper, we consider the problem of optimizing the revenue a web publisher gets through real-time bidding (i.e. from ads sold in real-time auctions) and direct (i.e. from ads sold through contracts agreed in advance). We consider a setting where the publisher is able to bid in the real-time bidding auction for each impression. If it wins the auction, it chooses a direct campaign to deliver and displays the corresponding ad. This paper presents an algorithm to build an optimal strategy for the publisher to deliver its direct campaigns while maximizing its real-time bidding revenue. The optimal strategy gives a formula to determine the publisher bid as well as a way to choose the direct campaign being delivered if the publisher bidder wins the auction, depending on the impression characteristics. The optimal strategy can be estimated on past auctions data. The algorithm scales with the number of campaigns and the size of the dataset. This is a very important feature, as in practice a publisher may have thousands of active direct campaigns at the same time and would like to estimate an optimal strategy on billions of auctions. The algorithm is a key component of a system which is being developed, and which will be deployed on thousands of web publishers worldwide, helping them to serve efficiently billions of ads a day to hundreds of millions of visitors.

📄 PDF Abstract BibTeX arXiv:2006.07070

Code (0)

등록된 구현이 없습니다.

JD-BP: A Joint-Decision Generative Framework for Auto-Bidding and Pricing

2026-04-07 · Linghui Meng, Chun Gan, Shengsheng Niu, Chengcheng Zhang 외 arxiv

Auto-bidding services optimize real-time bidding strategies for advertisers under key performance indicator (KPI) constraints such as target return on investment and budget. However, uncertainties such as model predictio…

Impression Allocation and Policy Search in Display Advertising

2022-03-11 · Di wu, Cheng Chen, Xiujun Chen, Junwei Pan 외

In online display advertising, guaranteed contracts and real-time bidding (RTB) are two major ways to sell impressions for a publisher. For large publishers, simultaneously selling impressions through both guaranteed con…

Multi-agent Reinforcement Learning

Bidding Agent Design in the LinkedIn Ad Marketplace

2022-02-25 · Yuan Gao, Kaiyu Yang, Yuanlong Chen, Min Liu 외

We establish a general optimization framework for the design of automated bidding agent in dynamic online marketplaces. It optimizes solely for the buyer's interest and is agnostic to the auction mechanism imposed by the…

A Multi-Agent Reinforcement Learning Method for Impression Allocation in Online Display Advertising

2018-09-10 · Di Wu, Cheng Chen, Xun Yang, Xiujun Chen 외

In online display advertising, guaranteed contracts and real-time bidding (RTB) are two major ways to sell impressions for a publisher. Despite the increasing popularity of RTB, there is still half of online display adve…

Multi-agent Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Neural Fitted Q Iteration based Optimal Bidding Strategy in Real Time Reactive Power Market_1

2021-01-07 · Jahnvi Patel, Devika Jay, Balaraman Ravindran, K. Shanti Swarup

In real time electricity markets, the objective of generation companies while bidding is to maximize their profit. The strategies for learning optimal bidding have been formulated through game theoretical approaches and …

Stochastic Optimization