Abstract
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it is seen more often. We would like to show advertisements such that, given the impact of ad fatigue, the overall efficiency of the system is optimized. We design an approximation algorithm, for the case that we study, that approaches the optimum as the number of unique ads shown, if there is only one available position, increases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abrams, Z., Mendelevitch, O., Tomlin, J.: Optimal delivery of sponsored search advertisements subject to budget constraints. ACM Conference on Electronic CommerceĀ (2007)
Aggarwal, G., Goel, A., Motwani, R.: Truthful auctions for pricing search keywords. ACM Conference on Electronic CommerceĀ (2006)
Chatterjee, P., Hoffman, D.L., Novak, T.P.: Modeling the clickstream: Implications for web-based advertising efforts. Marketing ScienceĀ 22(4), 520ā542 (2003)
Davis, H.: Google Advertising Tools (2006)
Edelman, B., Ostrovsky, M., Schwarz, M.: Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic ReviewĀ 97(1), 242ā259 (2007)
Fain, D., Pedersen, J.: Sponsored search: a brief history. Proceedings of the Second Workshop on Sponsored SearchĀ (2006)
Feng, J., Bhargava, H.K., Pennock, D.M.: Implementing sponsored search in web search engines: Computational evaluation of alternative mechanisms. Knowledge and Data ManagementĀ (2005)
Gupta, P., Geschwollen, H.: Automatic ad rotation via modeling effects of presentation count on clickthrough rate. Technical report (2006)
Kazienko, P., Adamski, M.: Personalized web advertising method. The Third International Conference on Adaptive HypermediaĀ (2004)
Lahaie, S., Pennock, D.M.: Revenue analysis of a family of ranking rules for keyword auctions. ACM Conference on Electronic CommerceĀ (2007)
Varian, H.R.: Position auctions. International Journal of Industrial OrganizationĀ (2005)
Zeff, R., Aronson, B.: Advertising on the Internet (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
Ā© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrams, Z., Vee, E. (2007). Personalized Ad Delivery When Ads Fatigue: An Approximation Algorithm. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)