Optimal budget allocation over time for keyword ads in Web portals

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

25 Scopus Citations
View graph of relations



Original languageEnglish
Pages (from-to)157-174
Journal / PublicationJournal of Optimization Theory and Applications
Issue number1
Publication statusPublished - Jan 2005
Externally publishedYes


This study investigates how to dynamically allocate resources with a given budget for advertising through Web portals using keyword-activated banner ads on the Internet. Identifying the factors that affect the potential number of banner ad clickthroughs in each portal, we show that the process of budget allocation between the two types of portals (generic vs specialized) that leads to the largest banner clicksthrough in the long run is an optimal control problem. Using techniques of dynamic programming, we find analytical solutions for the optimal budgeting decisions. Our analysis shows that an advertiser's optimal portal budgeting depends non-linearly on the number of visitors who type the same trigger keyword and the average clicksthrough rates, as well as on the advertiser and ad effectiveness. Further, we find that the maximal number of banner clickthroughs from both portals, at time t, depends on the remaining budget until the end of the planning period. The analytical results have useful managerial insight. One of the interesting features of our solution shows that, while a large visitor base may favor the generic portal, other parameters may affect it unfavorably: e.g., lower clickthrough rates of keyword banners from a more heterogeneous audience. Using a specificaction that is consistent with empirical observations, we show that, in the long run, an advertiser must always spend more ad money at the specialized portal.

Research Area(s)

  • Banner advertising, Dynamic budget allocation, Dynamic programming, Internet advertising strategy, Online advertising, Optimal control