skip to main content
research-article

Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria

Published:12 June 2020Publication History
Skip Abstract Section

Abstract

We analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of an optimal bidding strategy. In particular, we show that an optimal bidding strategies decomposes the problem into disjoint sets of campaigns and targeting groups. In addition, we show that pure bidding strategies that use only a single bid value for each campaign are not optimal when the supply curves are not continuous. For this case, we derive a lower-bound on the optimal cost of any bidding strategy, as well as mixed bidding strategies that either achieve the lower-bound or can get arbitrarily close to it.

References

  1. Santiago R. Balseiro, Jon Feldman, Vahab Mirrokni, and S. Muthukrishnan. 2014. Yield Optimization of Display Advertising with Ad Exchange. Management Science , Vol. 60, 12 (2014), 2886--2907.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ying Cui, Ruofei Zhang, Wei Li, and Jianchang Mao. 2011. Bid Landscape Forecasting in Online Ad Exchange Marketplace. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '11). ACM, New York, NY, USA, 265--273. https://doi.org/10.1145/2020408.2020454Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Robert G. Gallager. 1996. Discrete Stochastic Processes .Springer.Google ScholarGoogle Scholar
  4. R. Gummadi, P. B. Key, and A. Proutiere. 2011. Optimal bidding strategies in dynamic auctions with budget constraints. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . 588--588. https://doi.org/10.1109/Allerton.2011.6120220Google ScholarGoogle ScholarCross RefCross Ref
  5. Chong Jiang, Carolyn L. Beck, and R Srikant. 2014. Bidding with limited statistical knowledge in online auctions. ACM SIGMETRICS Performance Evaluation Review , Vol. 41 (04 2014), 38--41. https://doi.org/10.1145/2627534.2627546Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Aranyak Mehta. 2013. Online Matching and Ad Allocation. Found. Trends Theor. Comput. Sci. , Vol. 8, 4 (Oct. 2013), 265--368. https://doi.org/10.1561/0400000057Google ScholarGoogle Scholar
  7. Claudia Perlich, Brian Dalessandro, Rod Hook, Ori Stitelman, Troy Raeder, and Foster Provost. 2012. Bid Optimizing and Inventory Scoring in Targeted Online Advertising. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '12). ACM, New York, NY, USA, 804--812. https://doi.org/10.1145/2339530.2339655Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Santiago R. Balseiro and Yonatan Gur. 2017. Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. SSRN Electronic Journal (02 2017). https://doi.org/10.2139/ssrn.2921446Google ScholarGoogle Scholar
  9. Panagiotis Spentzouris, Iordanis Koutsopoulos, Kasper Grud Madsen, and Tommy Vestergaard Hansen. 2018. Advertiser Bidding Prediction and Optimization in Online Advertising . 413--424. https://doi.org/10.1007/978--3--319--92007--8_35Google ScholarGoogle Scholar
  10. Weinan Zhang and Jun Wang. 2015. Statistical Arbitrage Mining for Display Advertising. (06 2015). https://doi.org/10.1145/2783258.2783269Google ScholarGoogle Scholar
  11. Weinan Zhang, Shuai Yuan, and Jun Wang. 2014. Optimal Real-time Bidding for Display Advertising. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '14). ACM, New York, NY, USA, 1077--1086. https://doi.org/10.1145/2623330.2623633Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Weinan Zhang, Ying Zhang, Bin Gao, Yong Yu, Xiaojie Yuan, and Tie-Yan Liu. 2012. Joint optimization of bid and budget allocation in sponsored search. Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (08 2012). https://doi.org/10.1145/2339530.2339716Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimal Bidding Strategies for Online Ad Auctions with Overlapping Targeting Criteria

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Article Metrics

          • Downloads (Last 12 months)14
          • Downloads (Last 6 weeks)2

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!