Optimizing direct response in Internet display advertising

作者:

Highlights:

摘要

Internet display advertising has grown into a multi-billion dollar a year global industry and direct response campaigns account for about three-quarters of all Internet display advertising. In such campaigns, advertisers reach out to a target audience via some form of a visual advertisement (hereinafter also called “ad”) to maximize short-term sales revenue. In this study, we formulate an advertiser’s revenue maximization problem in direct response Internet display advertisement campaigns as a mixed integer program via piecewise linear approximation of the revenue function. A novelty of our approach is that ad location and content issues are explicitly incorporated in the optimization model. Computational experiments on a large-scale actual campaign indicate that adopting the optimal media schedule can significantly increase advertising revenues without any budget changes, and reasonably sized instances of the problem can be solved within short execution times.

论文关键词:Internet display advertising,Direct response marketing,Negative binomial distribution,Separable programming,Mixed integer programming

论文评审过程:Received 23 March 2011, Revised 21 September 2011, Accepted 10 November 2011, Available online 25 November 2011.

论文官网地址:https://doi.org/10.1016/j.elerap.2011.11.002