EconPapers    
Economics at your fingertips  
 

A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements

Ali Hojjat (), John Turner (), Suleyman Cetintas () and Jian Yang ()
Additional contact information
Ali Hojjat: Peter T. Paul College of Business and Economics, University of New Hampshire, Durham, New Hampshire 03824
John Turner: The Paul Merage School of Business, University of California Irvine, Irvine, California 92697
Suleyman Cetintas: Yahoo Research, Sunnyvale, California 94089
Jian Yang: Yahoo Research, Sunnyvale, California 94089

Operations Research, 2017, vol. 65, issue 2, 289-313

Abstract: Motivated by recent trends in online advertising and advancements made by online publishers, we consider a new form of contract that allows advertisers to specify the number of unique individuals that should see their ad ( reach ) and the minimum number of times each individual should be exposed ( frequency ). We develop an optimization framework that aims for minimal under-delivery and proper spread of each campaign over its targeted demographics. As well, we introduce a pattern -based delivery mechanism that allows us to integrate a variety of interesting features into a website’s ad allocation optimization problem that have not been possible before. For example, our approach allows publishers to implement any desired pacing of ads over time at the user level or control the number of competing brands seen by each individual. We develop a two-phase algorithm that employs column generation in a hierarchical scheme with three parallelizable components. Numerical tests with real industry data show that our algorithm produces high-quality solutions and has promising run-time and scalability. Several extensions of the model are presented, e.g., to account for multiple ad positions on the webpage or randomness in the website visitors’ arrival process.

Keywords: online advertising; guaranteed targeted display advertising; reach; frequency; uniform delivery; column generation; cutting stock; quadratic programming (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1287/opre.2016.1567 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:65:y:2017:i:2:p:289-313

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:oropre:v:65:y:2017:i:2:p:289-313