Advertising Campaigns Management: Should We Be Greedy? - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Advertising Campaigns Management: Should We Be Greedy?

Résumé

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.
Fichier principal
Vignette du fichier
icdm-2010-final.pdf (161.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00772447 , version 1 (11-01-2013)

Identifiants

  • HAL Id : hal-00772447 , version 1

Citer

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⟩
317 Consultations
142 Téléchargements

Partager

Gmail Facebook X LinkedIn More