Statistical Arbitrage Mining for Display Advertising
Not on the map. Why?
Abstract (arXiv)
We study and formulate arbitrage in display advertising. Real-Time Bidding (RTB) mimics stock spot exchanges and utilises computers to algorithmically buy display ads per impression via a real-time auction. Despite the new automation, the ad markets are still informationally inefficient due to the heavily fragmented marketplaces. Two display impressions with similar or identical effectiveness (e.g., measured by conversion or click-through rates for a targeted audience) may sell for quite different prices at different market segments or pricing schemes. In this paper, we propose a novel data mining paradigm called Statistical Arbitrage Mining (SAM) focusing on mining and exploiting price discrepancies between two pricing schemes. In essence, our SAMer is a meta-bidder that hedges advertisers' risk between CPA (cost per action)-based campaigns and CPM (cost per mille impressions)-based ad inventories; it statistically assesses the potential profit and cost for an incoming CPM bid request against a portfolio of CPA campaigns based on the estimated conversion rate, bid landscape and other statistics learned from historical data. In SAM, (i) functional optimisation is utilised to seek for optimal bidding to maximise the expected arbitrage net profit, and (ii) a portfolio-based risk management solution is leveraged to reallocate bid volume and budget across the set of campaigns to make a risk and return trade-off. We propose to jointly optimise both components in an EM fashion with high efficiency to help the meta-bidder successfully catch the transient statistical arbitrage opportunities in RTB. Both the offline experiments on a real-world large-scale dataset and online A/B tests on a commercial platform demonstrate the effectiveness of our proposed solution in exploiting arbitrage in various model settings and market environments.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jun 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 1.
6 papers.
- 2023Offline Reinforcement Learning for Optimizing Production Bidding Policiescited by 8
- 2023Utility-Maximizing Bidding Strategy for Data Consumers in Auction-based Federated Learningcited by 7
- 2022Real-time Bidding Strategy in Display Advertising: An Empirical Analysiscited by 4
- 2021Bid Optimization using Maximum Entropy Reinforcement Learningcited by 1
- 2022Adaptive Risk-Aware Bidding with Budget Constraint in Display Advertisingcited by 1
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithmscited by 1
- 2025Autobidding Arena: unified evaluation of the classical and RL-based autobidding algorithms22 Oct 2025
- 2023Offline Reinforcement Learning for Optimizing Production Bidding Policies13 Oct 2023
- 2023Utility-Maximizing Bidding Strategy for Data Consumers in Auction-based Federated Learning11 May 2023
- 2022Adaptive Risk-Aware Bidding with Budget Constraint in Display Advertising6 Dec 2022
- 2022Real-time Bidding Strategy in Display Advertising: An Empirical Analysis30 Nov 2022
- 2021Bid Optimization using Maximum Entropy Reinforcement Learning11 Oct 2021