Managing advertising campaigns -- an approximate planning approach

Sertan Girgin 1 Jérémie Mary 1 Philippe Preux 1 Olivier Nicol 1
1 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
Abstract : We consider the problem of displaying commercial advertisements on web pages, in the "cost per click" model. The advertisement server has to learn the appeal of each type of visitor for the different advertisements in order to maximize the profit. Advertisements have constraints such as a certain number of clicks to draw, as well as a lifetime. This problem is thus inherently dynamic, and intimately combines combinatorial and statistical issues. To set the stage, it is also noteworthy that we deal with very rare events of interest, since the base probability of one click is in the order of 10−4. Different approaches may be thought of, ranging from computationally demanding ones (use of Markov decision processes, or stochastic programming) to very fast ones.We introduce NOSEED, an adaptive policy learning algorithm based on a combination of linear programming and multi-arm bandits. We also propose a way to evaluate the extent to which we have to handle the constraints (which is directly related to the computation cost). We investigate the performance of our system through simulations on a realistic model designed with an important commercial web actor.
Document type :
Journal articles
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00747722
Contributor : Preux Philippe <>
Submitted on : Thursday, November 8, 2012 - 3:28:55 PM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Saturday, February 9, 2013 - 3:41:35 AM

File

FCS-11073.final.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

Sertan Girgin, Jérémie Mary, Philippe Preux, Olivier Nicol. Managing advertising campaigns -- an approximate planning approach. Frontiers of Computer Science, Springer Verlag, 2012, 6 (2), pp.209-229. ⟨http://rd.springer.com/article/10.1007/s11704-012-2873-5⟩. ⟨10.1007/s11704-012-2873-5⟩. ⟨hal-00747722⟩

Share

Metrics

Record views

550

Files downloads

1215