2000 character limit reached
Optimizing On-Line Advertising
Published 24 Nov 2010 in cs.IR | (1011.5364v1)
Abstract: We want to find the optimal strategy for displaying advertisements e.g. banners, videos, in given locations at given times under some realistic dynamic constraints. Our primary goal is to maximize the expected revenue in a given period of time, i.e. the total profit produced by the impressions, which depends on profit-generating events such as the impressions themselves, the ensuing clicks and registrations. Moreover we must take into consideration the possibility that the constraints could change in time in a way that cannot always be foreseen.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.