skip to main content
10.1145/2792838.2800194acmconferencesArticle/Chapter ViewAbstractPublication PagesrecsysConference Proceedingsconference-collections
research-article

Selection and Ordering of Linear Online Video Ads

Published:16 September 2015Publication History

ABSTRACT

This paper studies the selection and ordering of in-stream ads in videos shown in online content publishers. We propose an allocation algorithm that uses a collective measure of price and quality for each ad and factors in slot-specific continuation probabilities to maximize publisher revenue. The algorithm is based on cascade models and uses a dynamic programming method to assign linear (video) ads to slots in an online video. The approach accounts for the negative externality created by lower quality ads placed in a video, leading to viewer exit and thereby preventing the publisher from showing the subsequent ads scheduled in that session. Our algorithm is scalable and suited for real-time applications. A large log of viewer activity from a video ad platform is used to empirically test the algorithm. A series of simulations show that our algorithm, when compared to other algorithms currently practiced in industry, generates more revenue for the publisher and increases viewer retention.

Skip Supplemental Material Section

Supplemental Material

p203.mp4

mp4

1.6 GB

References

  1. Internet Advertsing Bureau. Iab internet advertising revenue report 2013 conducted by Pricewaterhouse Coopers (pwc). Accessed: 2015-04--10.Google ScholarGoogle Scholar
  2. Kenneth C Wilbur, Linli Xu, and David Kempe. Correcting audience externalities in television advertising. Marketing Science, 32(6):892--912, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  3. Hal R Varian. Position auctions. International Journal of Industrial Organization, 25(6):1163--1178, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  4. Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. Technical report, National Bureau of Economic Research, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  5. Gagan Aggarwal, Ashish Goel, and Rajeev Motwani. Truthful auctions for pricing search keywords. In Proceedings of the 7th ACM conference on Electronic commerce, pages 1--7. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sébastien Lahaie, David M Pennock, Amin Saberi, and Rakesh V Vohra. Sponsored search auctions. Algorithmic game theory, pages 699--716, 2007.Google ScholarGoogle Scholar
  7. Li Liang and Qi Qi. Cooperative or vindictive: Bidding strategies in sponsored search auction. In Internet and Network Economics, pages 167--178. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tao Qin, Wei Chen, and Tie-Yan Liu. Sponsored search auctions: Recent advances and future directions. ACM Transactions on Intelligent Systems and Technology (TIST), 5(4):60, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. David Maxwell Chickering and David Heckerman. Targeted advertising on the web with inventory management. Interfaces, 33(5):71--77, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. John Turner, Alan Scheller-Wolf, and Sridhar Tayur. Or practice-scheduling of dynamic in-game advertising. Operations research, 59(1):1--16, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Guillaume Roels and Kristin Fridgeirsdottir. Dynamic revenue management for online display advertising. Journal of Revenue & Pricing Management, 8(5):452--466, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  12. David Kempe and Mohammad Mahdian. A cascade model for externalities in sponsored search. In Internet and Network Economics, pages 585--596. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Gagan Aggarwal, Jon Feldman, S Muthukrishnan, and Martin Pál. Sponsored search auctions with markovian users. In Internet and Network Economics, pages 621--628. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. VF Araman and K Fridgeirsdottir. Online advertising: Revenue management approach. Technical report, Working paper. London Business School, 2008.Google ScholarGoogle Scholar
  15. Alf Kimms and Michael Muller-Bungart. Revenue management for broadcasting commercials: the channel's problem of selecting and scheduling the advertisements to be aired. International Journal of Revenue Management, 1(1):28--44, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  16. Victor F Araman and Ioana Popescu. Stochastic revenue management models for media broadcasting. Technical report, Working paper, 2007.Google ScholarGoogle Scholar
  17. Thorsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, Filip Radlinski, and Geri Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Transactions on Information Systems (TOIS), 25(2):7, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Kinshuk Jerath, Liye Ma, Young-Hoon Park, and Kannan Srinivasan. A "position paradox" in sponsored search auctions. Marketing Science, 30(4):612--627, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Susan Athey and Glenn Ellison. Position auctions with consumer search. Technical report, National Bureau of Economic Research, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  20. Matthew Richardson, Ewa Dominowska, and Robert Ragno. Predicting clicks: estimating the click-through rate for new ads. In Proceedings of the 16th international conference on World Wide Web, pages 521--530. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Sculley, Robert G. Malkin, Sugato Basu, and Roberto J. Bayardo. Predicting bounce rates in sponsored search advertisements. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '09, pages 1325--1334, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Paat Rusmevichientong and David P Williamson. An adaptive algorithm for selecting profitable keywords for search-based advertising services. In Proceedings of the 7th ACM Conference on Electronic Commerce, pages 260--269. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Peter McCullagh, John A Nelder, and P McCullagh. Generalized linear models, volume 2. Chapman and Hall London, 1989.Google ScholarGoogle ScholarCross RefCross Ref
  24. Wreetabrata Kar, Viswanathan Swaminathan, and Paulo Albuquerque. Measuring Quality of Linear Ads in Online Videos. Working Paper, 2015.Google ScholarGoogle Scholar
  25. Dan Zigmond, Sundar Dorai-Raj, Yannet Interian, and Igor Naverniouk. Measuring advertising quality based on audience retention. Journal of Advertising Research, 49(4):419--428, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  26. Nick Craswell, Onno Zoeter, Michael Taylor, and Bill Ramsey. An experimental comparison of click position-bias models. In Proceedings of the 2008 International Conference on Web Search and Data Mining, pages 87--94. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Tao Mei, Xian-Sheng Hua, and Shipeng Li. Videosense: A contextual in-video advertising system. Circuits and Systems for Video Technology, IEEE Transactions on, 19(12):1866--1879, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Karthik Yadati, Harish Katti, and Mohan Kankanhalli. Cavva: Computational affective video-in-video advertising. Multimedia, IEEE Transactions on, 16(1):15--23, 2014.Google ScholarGoogle Scholar

Index Terms

  1. Selection and Ordering of Linear Online Video Ads

    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
    • Published in

      cover image ACM Conferences
      RecSys '15: Proceedings of the 9th ACM Conference on Recommender Systems
      September 2015
      414 pages
      ISBN:9781450336925
      DOI:10.1145/2792838

      Copyright © 2015 ACM

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 September 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      RecSys '15 Paper Acceptance Rate28of131submissions,21%Overall Acceptance Rate254of1,295submissions,20%

      Upcoming Conference

      RecSys '24
      18th ACM Conference on Recommender Systems
      October 14 - 18, 2024
      Bari , Italy

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader