Optimal Allocation of Real-Time-Bidding and Direct Campaigns
Gr\'egoire Jauvion, Nicolas Grislain

TL;DR
This paper introduces an algorithm for publishers to optimally allocate revenue between real-time bidding and direct campaigns, maximizing profit by deciding bidding strategies and campaign selection based on impression data.
Contribution
It presents a scalable, data-driven algorithm to optimize revenue from both real-time bidding and direct campaigns, suitable for large-scale deployment.
Findings
Algorithm effectively estimates optimal strategies from past auction data.
Scales efficiently with large numbers of campaigns and data volume.
Supports deployment across thousands of publishers worldwide.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
