Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2623330.2623633acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Optimal real-time bidding for display advertising

Published: 24 August 2014 Publication History
  • Get Citation Alerts
  • Abstract

    In this paper we study bid optimisation for real-time bidding (RTB) based display advertising. RTB allows advertisers to bid on a display ad impression in real time when it is being generated. It goes beyond contextual advertising by motivating the bidding focused on user data and it is different from the sponsored search auction where the bid price is associated with keywords. For the demand side, a fundamental technical challenge is to automate the bidding process based on the budget, the campaign objective and various information gathered in runtime and in history. In this paper, the programmatic bidding is cast as a functional optimisation problem. Under certain dependency assumptions, we derive simple bidding functions that can be calculated in real time; our finding shows that the optimal bid has a non-linear relationship with the impression level evaluation such as the click-through rate and the conversion rate, which are estimated in real time from the impression level features. This is different from previous work that is mainly focused on a linear bidding function. Our mathematical derivation suggests that optimal bidding strategies should try to bid more impressions rather than focus on a small set of high valued impressions because according to the current RTB market data, compared to the higher evaluated impressions, the lower evaluated ones are more cost effective and the chances of winning them are relatively higher. Aside from the theoretical insights, offline experiments on a real dataset and online experiments on a production RTB system verify the effectiveness of our proposed optimal bidding strategies and the functional optimisation framework.

    Supplementary Material

    MP4 File (p1077-sidebyside.mp4)

    References

    [1]
    DSP bidding optimization task. http://contest.ipinyou.com/rule.shtml. Accessed: 2014-02-06.
    [2]
    Z. Abrams. Revenue maximization when bidders have budgets. In SODA, pages 1074--1082, 2006.
    [3]
    K. Amin, M. Kearns, P. Key, and A. Schwaighofer. Budget optimization for sponsored search: Censored learning in mdps. In UAI, 2012.
    [4]
    A. Animesh, V. Ramachandran, and S. Viswanathan. Online Advertisers Bidding Strategies for Search, Experience, and Credence Goods: An Empirical Investigation. In Second Workshop on Sponsored Search Auctions. EC, 2005.
    [5]
    C. Borgs, J. Chayes, N. Immorlica, K. Jain, O. Etesami, and M. Mahdian. Dynamics of bid optimization in online advertisement auctions. In WWW, pages 531--540. ACM, 2007.
    [6]
    A. Broder, M. Fontoura, V. Josifovski, and L. Riedel. A semantic approach to contextual advertising. In SIGIR, 2007.
    [7]
    A. Broder, E. Gabrilovich, V. Josifovski, G. Mavromatis, and A. Smola. Bid generation for advanced match in sponsored search. In WSDM, pages 515--524. ACM, 2011.
    [8]
    S. Cetintas, D. Chen, and L. Si. Forecasting user visits for online display advertising. Information Retrieval, 16(3):369--390, 2013.
    [9]
    T. Chakraborty, E. Even-Dar, S. Guha, Y. Mansour, and S. Muthukrishnan. Selective call out and real time bidding. In Internet and Network Economics, pages 145--157. 2010.
    [10]
    Y. Chen, P. Berkhin, B. Anderson, and N. R. Devanur. Real-time bidding algorithms for performance-based display ad allocation. KDD, 2011.
    [11]
    N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In WSDM, pages 87--94. ACM, 2008.
    [12]
    Y. Cui, R. Zhang, W. Li, and J. Mao. Bid landscape forecasting in online ad exchange marketplace. In KDD, pages 265--273. ACM, 2011.
    [13]
    B. Dalessandro, R. Hook, C. Perlich, and F. Provost. Evaluating and optimizing online advertising: Forget the click, but there are good proxies. 2012.
    [14]
    N. R. Devenur and T. P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In EC, pages 71--78. ACM, 2009.
    [15]
    B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research, 2005.
    [16]
    E. Even Dar, V. S. Mirrokni, S. Muthukrishnan, Y. Mansour, and U. Nadav. Bid optimization for broad match ad auctions. In WWW, pages 231--240. ACM, 2009.
    [17]
    J. Feldman, S. Muthukrishnan, M. Pal, and C. Stein. Budget optimization in search-based advertising auctions. In EC, 2007.
    [18]
    A. Ghosh, B. I. P. Rubinstein, S. Vassilvitskii, and M. Zinkevich. Adaptive bidding for display advertising. In WWW, 2009.
    [19]
    T. Graepel, J. Q. Candela, T. Borchert, and R. Herbrich. Web-scale bayesian click-through rate prediction for sponsored search advertising in microsoft's bing search engine. In ICML, pages 13--20, 2010.
    [20]
    R. Gummadi, P. Key, and A. Proutiere. Optimal bidding strategies in dynamic auctions with budget constraints. In CCC, pages 588--588. IEEE, 2011.
    [21]
    K. Hosanagar and V. Cherepanov. Optimal bidding in stochastic budget constrained slot auctions. In EC, 2008.
    [22]
    J. Jaworska and M. Sydow. Behavioural targeting in on-line advertising: An empirical study. In WISE. 2008.
    [23]
    B. Kitts and B. Leblanc. Optimal bidding on keyword auctions. Electronic Markets, 14(3):186--201, 2004.
    [24]
    V. Krishna. Auction theory. Academic press, 2009.
    [25]
    K.-C. Lee, A. Jalali, and A. Dasdan. Real time bid optimization with smooth budget delivery in online advertising. ADKDD, 2013.
    [26]
    K.-C. Lee, B. Orten, A. Dasdan, and W. Li. Estimating conversion rate in display advertising from past performance data. In KDD, pages 768--776. ACM, 2012.
    [27]
    R. McGill, J. W. Tukey, and W. A. Larsen. Variations of box plots. The American Statistician, 32(1):12--16, 1978.
    [28]
    A. Mehta, A. Saberi, U. V. Vazirani, and V. V. Vazirani. AdWords and Generalized On-line Matching. In FOCS, 2005.
    [29]
    S. Muthukrishnan. Ad exchanges: Research issues. In Internet and network economics, pages 1--12. Springer, 2009.
    [30]
    S. Muthukrishnan, M. Pal, and Z. Svitkina. Stochastic models for budget optimization in search-based advertising. In Internet and Network Economics. 2007.
    [31]
    L. Olejnik, T. Minh-Dung, C. Castelluccia, et al. Selling off privacy at auction. 2013.
    [32]
    C. Perlich, B. Dalessandro, R. Hook, O. Stitelman, T. Raeder, and F. Provost. Bid optimizing and inventory scoring in targeted online advertising. In KDD, pages 804--812, 2012.
    [33]
    F. Radlinski, A. Broder, P. Ciccolo, E. Gabrilovich, V. Josifovski, and L. Riedel. Optimizing relevance and revenue in ad search. In SIGIR, pages 403--410, 2008.
    [34]
    M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In WWW, pages 521--530. ACM, 2007.
    [35]
    J. Wang, S. Yuan, X. Shen, and S. Seljan. Real-time bidding: A new frontier of computational advertising research. In CIKM Tutorial, 2013.
    [36]
    S. Yuan, B. Chen, J. Wang, P. Mason, and S. Seljan. An Empirical Study of Reserve Price Optimisation in Real-Time Bidding. In KDD, 2014.
    [37]
    S. Yuan and J. Wang. Sequential selection of correlated ads by pomdps. In CIKM, pages 515--524, 2012.
    [38]
    S. Yuan, J. Wang, and X. Zhao. Real-time bidding for online advertising: measurement and analysis. In ADKDD, 2013.
    [39]
    W. Zhang, T. Chen, J. Wang, and Y. Yu. Optimizing top-n collaborative filtering via dynamic negative item sampling. In SIGIR, pages 785--788. ACM, 2013.
    [40]
    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, pages 1177--1185. ACM, 2012.
    [41]
    Y. Zhang, W. Zhang, B. Gao, X. Yuan, and T.-Y. Liu. Bid keyword suggestion in sponsored search based on competitiveness and relevance. IPM, 2014.
    [42]
    Y. Zhou, D. Chakrabarty, and R. Lukose. Budget constrained bidding in keyword auctions and online knapsack problems. In Internet and Network Economics, pages 566--576. 2008.
    [43]
    Y. Zhu, G. Wang, J. Yang, D. Wang, J. Yan, J. Hu, and Z. Chen. Optimizing Search Engine Revenue in Sponsored Search. In SIGIR, 2009.

    Cited By

    View all
    • (2024)An Efficient Cloud-Powered Bidding MarketplaceInternational Journal of Innovative Science and Research Technology (IJISRT)10.38124/ijisrt/IJISRT24APR1916(2087-2091)Online publication date: 8-May-2024
    • (2024)Imagine and Imitate: Cost-Effective Bidding under Partially Observable Price LandscapesBig Data and Cognitive Computing10.3390/bdcc80500468:5(46)Online publication date: 28-Apr-2024
    • (2024)MeFiNet: Modeling multi-semantic convolution-based feature interactions for CTR predictionIntelligent Data Analysis10.3233/IDA-22711328:1(261-278)Online publication date: 3-Feb-2024
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
    August 2014
    2028 pages
    ISBN:9781450329569
    DOI:10.1145/2623330
    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: 24 August 2014

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. bid optimisation
    2. demand-side platform
    3. display advertising
    4. real-time bidding

    Qualifiers

    • Research-article

    Conference

    KDD '14
    Sponsor:

    Acceptance Rates

    KDD '14 Paper Acceptance Rate 151 of 1,036 submissions, 15%;
    Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

    Upcoming Conference

    KDD '24

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)172
    • Downloads (Last 6 weeks)14
    Reflects downloads up to 10 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)An Efficient Cloud-Powered Bidding MarketplaceInternational Journal of Innovative Science and Research Technology (IJISRT)10.38124/ijisrt/IJISRT24APR1916(2087-2091)Online publication date: 8-May-2024
    • (2024)Imagine and Imitate: Cost-Effective Bidding under Partially Observable Price LandscapesBig Data and Cognitive Computing10.3390/bdcc80500468:5(46)Online publication date: 28-Apr-2024
    • (2024)MeFiNet: Modeling multi-semantic convolution-based feature interactions for CTR predictionIntelligent Data Analysis10.3233/IDA-22711328:1(261-278)Online publication date: 3-Feb-2024
    • (2024)Bandits with Stochastic Experts: Constant Regret, Empirical Experts and EpisodesACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/36802799:3(1-33)Online publication date: 25-Jul-2024
    • (2024)Convexity in Real-time Bidding and Related ProblemsACM Transactions on Economics and Computation10.1145/3656552Online publication date: 15-Apr-2024
    • (2024)Cost-Effective Active Learning for Bid Exploration in Online AdvertisingProceedings of the 17th ACM International Conference on Web Search and Data Mining10.1145/3616855.3635839(788-796)Online publication date: 4-Mar-2024
    • (2024)Visual Explanation for Advertising Creative WorkflowExtended Abstracts of the 2024 CHI Conference on Human Factors in Computing Systems10.1145/3613905.3651123(1-8)Online publication date: 11-May-2024
    • (2024)Mystique: A Budget Pacing System for Performance Optimization in Online AdvertisingCompanion Proceedings of the ACM on Web Conference 202410.1145/3589335.3648342(433-442)Online publication date: 13-May-2024
    • (2024)Optimization-Based Budget Pacing in eBay Sponsored SearchCompanion Proceedings of the ACM on Web Conference 202410.1145/3589335.3648331(328-337)Online publication date: 13-May-2024
    • (2024)Trajectory-wise Iterative Reinforcement Learning Framework for Auto-biddingProceedings of the ACM on Web Conference 202410.1145/3589334.3645534(4193-4203)Online publication date: 13-May-2024
    • Show More Cited By

    View Options

    Get Access

    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