OPTIMIZED DELIVERY OF ON-LINE ADVERTISEMENTS - A Linear Programming Approach to the Delivery of On-line Advertisements

Fabrizio Caruso, Giovanni Giuffrida

Abstract

We find an optimal strategy for displaying advertisements in given locations at given times under some realistic dynamic constraints. Our goal is to maximize the total profit produced by the impressions, which depends on profit-generating events such as the impressions themselves and the ensuing clicks. We must take into account the possibility that the constraints could change over time in a way that cannot always be foreseen.

References

  1. Abe, N. and Nakamura, A. (1999). Learning to Optimally Schedule Internet Banner Advertisements. In ICML 7899: Proceedings of the Sixteenth International Conference on Machine Learning, pages 12-21, San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
  2. Abrams, Z., Mendelevitch, O., and Tomlin, J. (2007). Optimal delivery of sponsored search advertisements subject to budget constraints. In Proc. of the 8th ACM conf. on Electronic commerce, EC 7807, pages 272- 278, New York, USA. ACM.
  3. Alaei, S., Arcaute, E., Khuller, S., Ma, W., Malekian, A., and Tomlin, J. (2009). Online allocation of display advertisements subject to advanced sales contracts. In Proc. of the 3rd International Workshop on Data Mining and Audience Intelligence for Advertising, ADKDD 7809, pages 69-77, New York, USA. ACM.
  4. Caruso, F., Giuffrida, G., and Zarba, C. (2011). Real-time Behavioral Targeting of Banner Advertising. In Book of Abstracts of the CLADAG 2011.
  5. Dantzig, G. (1963). Linear Programming and Extensions. Princeton University.
  6. Hitchcock, F. (1941). The distribution of a product from several sources to numerous localities. Journal of Mathematics and Physics, 20:224-230.
  7. Langheinrich, M., Nakamura, A., Abe, N., Kamba, T., and Koseki, Y. (1999). Unintrusive customization techniques for web advertising. Computer Networks, 31(11-16):1259-1272.
  8. Nakamura, A. (2002). Improvements in practical aspects of optimally scheduling web advertising. In WWW 7802: Proc. of the 11th international conf. on World Wide Web, pages 536-541, New York, USA. ACM.
  9. Vee, E., Vassilvitskii, S., and Shanmugasundaram, J. (2010). Optimal online assignment with forecasts. In Proc. of the 11th ACM conf. on Electronic commerce, EC 7810, pages 109-118, New York, USA. ACM.
Download


Paper Citation


in Harvard Style

Caruso F. and Giuffrida G. (2012). OPTIMIZED DELIVERY OF ON-LINE ADVERTISEMENTS - A Linear Programming Approach to the Delivery of On-line Advertisements . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 400-405. DOI: 10.5220/0003805504000405


in Bibtex Style

@conference{icaart12,
author={Fabrizio Caruso and Giovanni Giuffrida},
title={OPTIMIZED DELIVERY OF ON-LINE ADVERTISEMENTS - A Linear Programming Approach to the Delivery of On-line Advertisements},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={400-405},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003805504000405},
isbn={978-989-8425-95-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - OPTIMIZED DELIVERY OF ON-LINE ADVERTISEMENTS - A Linear Programming Approach to the Delivery of On-line Advertisements
SN - 978-989-8425-95-9
AU - Caruso F.
AU - Giuffrida G.
PY - 2012
SP - 400
EP - 405
DO - 10.5220/0003805504000405