[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/2783258.2783269acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Statistical Arbitrage Mining for Display Advertising

Published: 10 August 2015 Publication History

Abstract

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.

Supplementary Material

MP4 File (p1465.mp4)

References

[1]
K. Amin, M. Kearns, P. Key, and A. Schwaighofer. Budget optimization for sponsored search: Censored learning in MDPs. UAI, 2012.
[2]
A. Bhalgat, J. Feldman, and V. Mirrokni. Online allocation of display ads with smooth delivery. In KDD, 2012.
[3]
V. Bharadwaj, W. Ma, M. Schwarz, J. Shanmugasundaram, E. Vee, J. Xie, and J. Yang. Pricing guaranteed contracts in online display advertising. In CIKM, 2010.
[4]
D. Bloomfield. High-speed ad traders profit by arbitraging your eyeballs. http://goo.gl/3XoWd6, 2014. {Accessed 2-Feb-2015}.
[5]
R. Cavallo, R. P. McAfee, and S. Vassilvitskii. Display advertising auctions with arbitrage. In EC, 2012.
[6]
N. Chaitanya and Y. Narahari. Optimal equilibrium bidding strategies for budget constrained bidders in sponsored search auctions. Operat. Res., 2012.
[7]
B. Chen, S. Yuan, and J. Wang. A dynamic pricing model for unifying programmatic guarantee and real-time bidding in display advertising. ADKDD, 2014.
[8]
Y. Cui, R. Zhang, W. Li, and J. Mao. Bid landscape forecasting in online ad exchange marketplace. In KDD, 2011.
[9]
B. Dalessandro, C. Perlich, O. Stitelman, and F. Provost. Causally motivated attribution for online advertising. In ADKDD, 2012.
[10]
B. Edelman. The design of online advertising markets. Handbook of Market Design, 2010.
[11]
B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. National Bureau of Economic Research, 2005.
[12]
E. J. Elton, M. J. Gruber, S. J. Brown, and W. N. Goetzmann. Modern portfolio theory and investment analysis. JWS, 2009.
[13]
E. F. Fama. Efficient capital markets: A review of theory and empirical work. J. Finance, 1970.
[14]
J. Feldman, M. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In Algorithms--ESA. 2010.
[15]
E. Gatev, W. N. Goetzmann, and K. G. Rouwenhorst. Pairs trading: Performance of a relative-value arbitrage rule. Review of Financial Studies, 2006.
[16]
A. Ghosh, P. McAfee, K. Papineni, and S. Vassilvitskii. Bidding for representative allocations for display advertising. In WINE. 2009.
[17]
Google. The arrival of real-time bidding. 2011.
[18]
S. Hogan, R. Jarrow, M. Teo, and M. Warachka. Testing market efficiency using statistical arbitrage with applications to momentum and value strategies. Journal of Financial economics, 73(3), 2004.
[19]
Y. J. Hu. Performance-based pricing models in online advertising. Available at SSRN 501082, 2004.
[20]
K.-C. Lee, A. Jalali, and A. Dasdan. Real time bid optimization with smooth budget delivery in online advertising. In ADKDD, 2013.
[21]
K.-C. Lee, B. Orten, A. Dasdan, and W. Li. Estimating conversion rate in display advertising from past performance data. In KDD, 2012.
[22]
L. Li, W. Chu, J. Langford, and X. Wang. Unbiased offline evaluation of contextual-bandit-based news article recommendation algorithms. In WSDM, 2011.
[23]
H. Liao, L. Peng, Z. Liu, and X. Shen. iPinYou global rtb bidding algorithm competition dataset. In ADKDD, 2014.
[24]
H. Markowitz. Portfolio selection. The journal of finance, 7(1), 1952.
[25]
R. P. McAfee and S. Vassilvitskii. An overview of practical exchange design. Current Science, 2012.
[26]
R. McGill, J. W. Tukey, and W. A. Larsen. Variations of box plots. The American Statistician, 1978.
[27]
S. Muthukrishnan. Ad exchanges: Research issues. In WINE. 2009.
[28]
C. Perlich, B. Dalessandro, R. Hook, O. Stitelman, T. Raeder, and F. Provost. Bid optimizing and inventory scoring in targeted online advertising. In KDD, 2012.
[29]
W. F. Sharpe. The sharpe ratio. Streetwise--the Best of the Journal of Portfolio Management, 1998.
[30]
J. Wang and J. Zhu. Portfolio theory of information retrieval. In SIGIR, 2009.
[31]
S. Yuan, J. Wang, B. Chen, P. Mason, and S. Seljan. An empirical study of reserve price optimisation in real-time bidding. In KDD. ACM, 2014.
[32]
S. Yuan, J. Wang, and X. Zhao. Real-time bidding for online advertising: measurement and analysis. In ADKDD, 2013.
[33]
W. Zhang, J. Wang, B. Chen, and X. Zhao. To personalize or not: a risk management perspective. In RecSys, 2013.
[34]
W. Zhang, S. Yuan, and J. Wang. Optimal real-time bidding for display advertising. In KDD, 2014.
[35]
W. Zhang, S. Yuan, and J. Wang. Real-time bidding benchmarking with ipinyou dataset. arXiv preprint arXiv:1407.7073, 2014.
[36]
W. Zhang, Y. Zhang, B. Gao, Y. Yu, X. Yuan, and T.-Y. Liu. Joint optimization of bid and budget allocation in sponsored search. In KDD, 2012.

Cited By

View all
  • (2024)Convexity in Real-time Bidding and Related ProblemsACM Transactions on Economics and Computation10.1145/3656552Online publication date: 15-Apr-2024
  • (2024)Offline Reinforcement Learning for Optimizing Production Bidding PoliciesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671555(5251-5259)Online publication date: 25-Aug-2024
  • (2024)Optimizing Real-Time Bidding Strategies: An Experimental Analysis of Reinforcement Learning and Machine Learning TechniquesProcedia Computer Science10.1016/j.procs.2024.04.191235(2017-2026)Online publication date: 2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
August 2015
2378 pages
ISBN:9781450336642
DOI:10.1145/2783258
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 August 2015

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. display ads
  2. real-time bidding
  3. statistical arbitrage

Qualifiers

  • Research-article

Conference

KDD '15
Sponsor:

Acceptance Rates

KDD '15 Paper Acceptance Rate 160 of 819 submissions, 20%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)15
  • Downloads (Last 6 weeks)1
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Convexity in Real-time Bidding and Related ProblemsACM Transactions on Economics and Computation10.1145/3656552Online publication date: 15-Apr-2024
  • (2024)Offline Reinforcement Learning for Optimizing Production Bidding PoliciesProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671555(5251-5259)Online publication date: 25-Aug-2024
  • (2024)Optimizing Real-Time Bidding Strategies: An Experimental Analysis of Reinforcement Learning and Machine Learning TechniquesProcedia Computer Science10.1016/j.procs.2024.04.191235(2017-2026)Online publication date: 2024
  • (2024)Real-time bidding with multi-agent reinforcement learning in multi-channel display advertisingNeural Computing and Applications10.1007/s00521-024-10649-6Online publication date: 18-Nov-2024
  • (2023)Adaptive RiskAware Bidding with Budget Constraint in Display AdvertisingACM SIGKDD Explorations Newsletter10.1145/3606274.360628125:1(73-82)Online publication date: 5-Jul-2023
  • (2023)Optimal Bidding Strategy with Smooth Budget Delivery in Online Advertising2023 31st International Conference on Electrical Engineering (ICEE)10.1109/ICEE59167.2023.10334752(315-321)Online publication date: 9-May-2023
  • (2023)A multimodal approach for improving market price estimation in online advertisingKnowledge-Based Systems10.1016/j.knosys.2023.110392266:COnline publication date: 22-Apr-2023
  • (2022)Bid optimization using maximum entropy reinforcement learningNeurocomputing10.1016/j.neucom.2022.05.108501(529-543)Online publication date: Aug-2022
  • (2022)Kaplan–Meier Markov networkKnowledge-Based Systems10.1016/j.knosys.2022.109248251:COnline publication date: 5-Sep-2022
  • (2021)Real-time Bidding for Time Constrained Impression Contracts in First and Second Price Auctions - Theory and AlgorithmsProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/34910495:3(1-37)Online publication date: 15-Dec-2021
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media