Advertising Campaigns Management: Should We Be Greedy?

Sertan Girgin 1 Jérémie Mary 1, 2 Philippe Preux 1, 2 Olivier Nicol 1, 2
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 advertise- ments on web pages in the "cost per click" model, which necessitates to learn the appeal of visitors for the different advertisements in order to maximize the revenue. In a realistic context, the 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 . We introduce an adaptive policy learning algorithm based on linear programming, and investigate its performance through simulations on a realistic model designed with an important commercial web actor.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00772447
Contributor : Preux Philippe <>
Submitted on : Friday, January 11, 2013 - 10:21:24 AM
Last modification on : Thursday, February 21, 2019 - 10:52:49 AM
Long-term archiving on : Friday, April 12, 2013 - 11:15:32 AM

File

icdm-2010-final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00772447, version 1

Collections

Citation

Sertan Girgin, Jérémie Mary, Philippe Preux, Olivier Nicol. Advertising Campaigns Management: Should We Be Greedy?. IEEE International Conference on Data Mining, Dec 2010, Sydney, Australia. pp.821-826. ⟨hal-00772447⟩

Share

Metrics

Record views

520

Files downloads

206