pith. sign in

arxiv: 1011.5364 · v1 · pith:ZPX6TK77new · submitted 2010-11-24 · 💻 cs.IR

Optimizing On-Line Advertising

classification 💻 cs.IR
keywords givenconstraintsimpressionstimeadvertisementsadvertisingalwaysbanners
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.