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

@article{Hojjat2017AUF,
  title={A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements},
  author={S. Ali Hojjat and John G. Turner and Suleyman Cetintas and Jian Yang},
  journal={Oper. Res.},
  year={2017},
  volume={65},
  pages={289-313}
}
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… 
Online Guaranteed-Delivery Advertising under Frequency Capping
TLDR
A two-phase framework to minimize under-delivery with the constraints of frequency capping and take other hard but actually demanded features into account by using a pattern-based delivery mechanism is proposed.
A Request-level Guaranteed Delivery Advertising Planning: Forecasting and Allocation
TLDR
Evaluations on large-scale real data and the performance of the deployed system both demonstrate that the design can significantly increase the request-level impression forecast accuracy and delivery rate.
Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad-Exchanges
TLDR
This paper offers mechanisms in which multiple ads can be displayed sequentially over the lifetime of the impression, and considers two plausible settings – one, where each auction is individually rational for the advertisers and the other, where advertisers are better off relative to the traditional mechanism over the long run.
Sustaining a Good Impression: Mechanisms for Selling Partitioned Impressions at Ad Exchanges
TLDR
This paper offers mechanisms in which multiple ads can be displayed sequentially over the lifetime of the impression, and considers two plausible settings—one where each auction is individually rational for the advertisers and one where advertisers are better off relative to the traditional mechanism over the long run—and derives an optimal mechanism for each setting.
A Mechanism Design Perspective of Live-streaming Commerce: The Role of Information Provision
TLDR
A mechanism design framework is used to demonstrate how the live-streaming platform can leverage information provision to improve its advertisement revenue upon traditional position auctions and shows that the revenue loss from neglecting information provision can be arbitrarily large.
Optimization of Operational Decisions in Digital Advertising: A Literature Review
The digital advertising industry has witnessed an impressive explosion since its inception. With Internet advertising revenues already at over $200 billion, the projections are for continued growth.
Auctions in the Online Display Advertising Chain: A Case for Independent Campaign Management
In many auctions, buyers are represented by an intermediary that manages their bidding process, along with that of other buyers. Notably, this is prevalent in the real-time online display advertising
Online Display Advertising Markets: A Literature Review and Future Directions
Display advertising is a $50 billion industry in which advertisers’ (e.g., P&G, Geico) demand for impressions is matched to publishers’ (e.g., Facebook, Wall Street Journal) supply of them. An ideal
Optimal Auctions and Pricing with Limited Information
TLDR
A novel approach is proposed, using dynamic programming, to characterize near-optimal data-driven pricing algorithms and their performance in the low sample regime of the online display advertising marketplace from an information structure perspective.
Planning Online Advertising Using Gini Indices
We study the online display advertising problem in which advertisers’ demands for ad exposures (impressions) of various types compete for slices of shared resources. In general, advertisers prefer to
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Delivering Guaranteed Display Ads under Reach and Frequency Requirements
TLDR
This work shows how the allocation and serving of online advertising can be solved efficiently using a column generation scheme in which only a small set of best patterns are kept in the optimization problem, and suggests that the algorithm has a promising run time and memory usage.
The Planning of Guaranteed Targeted Display Advertising
TLDR
This work defines Guaranteed Targeted Display Advertising as a class of media vehicles that include webpage banner ads, video games, electronic outdoor billboards, and the next generation of digital TV, and forms the GTDA planning problem as a transportation problem with quadratic objective.
SHALE: an efficient algorithm for allocation of guaranteed display advertising
TLDR
An efficient, lightweight method of generating a compact allocation plan that can be used to guide ad server decisions, which is "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution.
Ad serving using a compact allocation plan
TLDR
This work presents a solution to the guaranteed delivery ad serving problem using compact allocation plans, which can be efficiently queried by the ad server during an ad call; they are small, using only O(1) space for contract; and are stateless, allowing for distributed serving without any central coordination.
A unified optimization framework for auction and guaranteed delivery in online advertising
TLDR
A new unified optimization framework combining pay-per-click auctions and guaranteed delivery in sponsored search and a novel dynamic programming algorithm that takes the special structure of the ad allocation and pricing mechanisms into account is proposed.
Inventory Allocation for Online Graphical Display Advertising
TLDR
A multi-objective/goal programming model for the allocation of inventory of graphical advertisements, which considers two types of campaigns: guaranteed delivery (GD) and non-guaranteed delivery (NGD), which are sold using real-time auctions.
Bidding for Representative Allocations for Display Advertising
TLDR
This work characterize what allocations can be implemented with randomized bidding, namely those where the desired share obtained at each price is a non-increasing function of price.
Ad Delivery with Budgeted Advertisers: A Comprehensive LP Approach
TLDR
A linear program for optimizing revenue (or the total value to advertisers) that has an exponential number of variables is proposed and how to allocate advertisers to queries such that budget constraints are satisfied and efficiency or revenue is maximized is described.
Targeted Advertising on the Web with Inventory Management
TLDR
This work has developed a delivery system that maximizes click-through rate given inventory-management constraints in the form of advertisement quotas, and can generalize to find revenue-optimal advertisement schedules under a wide variety of pricing models.
Scheduling advertising slots for television
TLDR
An enhanced branch-and-bound algorithm is presented and shown to produce optimal solutions for each of several problems that were not computationally feasible for a previously developed branch- and-bound implementation.
...
...