Online Scheduling of Targeted Advertisements for IPTV

Behavioral targeting of content to users is a huge and lucrative business, valued as a $20 billion industry that is growing rapidly. So far, the dominant players in this field like Google and Yahoo! examine the user requests coming to their servers and place appropriate ads based on the user's search keywords. Triple-play service providers have access to all the traffic generated by the users and can generate more comprehensive profiles of users based on their TV, broadband, and mobile usage. Using such multisource profile information, they can generate new revenue streams by smart targeting of ads to their users over multiple screens (computer, TV, and mobile handset). This paper proposes methods to place targeted ads to a TV based on user's interests. It proposes an ad auction model that can leverage multisource profile and can handle dynamic profile-based targeting like Google's AdWords vis-à-vis static demography-based targeting of legacy TV. We then present a 0.502-competitive revenue maximizing scheduling algorithm that chooses a set of ads in each time slot and assigns users to one of these selected ads.

[1]  G. Nemhauser,et al.  Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .

[2]  Nicole Immorlica,et al.  Multi-unit auctions with budget-constrained bidders , 2005, EC '05.

[3]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

[4]  Patrick De Pelsmacker,et al.  Opportunities and Thresholds for Advertising on Interactive Digital TV , 2006 .

[5]  Amin Saberi,et al.  Allocating online advertisement space with unreliable estimates , 2007, EC '07.

[6]  Yishay Mansour,et al.  Auctions with Budget Constraints , 2004, SWAT.

[7]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.

[8]  Norm Hurst,et al.  MPEG Splicing: A New Standard for Television — SMPTE 312M , 1998 .

[9]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[10]  D. Hochbaum,et al.  Analysis of the greedy approach in problems of maximum k‐coverage , 1998 .

[11]  Diomidis Spinellis,et al.  Intelligent user interfaces in the living room: usability design for personalized television applications , 2003, IUI '03.

[12]  George M. Giaglis,et al.  A Lifestyle-Based Approach for Delivering Personalized Advertisements in Digital Interactive Television , 2006, J. Comput. Mediat. Commun..

[13]  Joseph W. Weber,et al.  IPTV Crash Course , 2006 .

[14]  SaberiAmin,et al.  AdWords and generalized online matching , 2007 .

[15]  Jerrold H. May,et al.  Using data mining to profile TV viewers , 2003, CACM.

[16]  Lamont Wood,et al.  Google, Inc. , 2005, Scientific American.

[17]  Amit Thawani,et al.  Context Aware Personalized Ad Insertion in an Interactive TV Environment , 2004 .

[18]  Joseph Naor,et al.  Improved bounds for online routing and packing via a primal-dual approach , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[19]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.