Number of items: 1.
Farahat, Ayman Privacy Preserving Frequency Capping in Internet Banner Advertising.
We describe an optimize-and-dispatch approach for delivering pay-per-impression advertisements in online advertising. The platform provider for an advertising network commits to showing advertisers’ banner ads while capping the number of advertising message shown to a unique user as the user transitions through the network. The traditional approach for enforcing frequency caps has been to use crosssite cookies to track users. However,cross-site cookies and other tracking mechanisms can infringe on the user privacy. In this paper, we propose a novel linear programming approach that decides when to show an ad to the user based solely on the page currently viewed by the users. We show that the frequency caps are fulﬁlled in expectation. We show the efficacy of that approach using simulation results. Categories and Subject Descriptors: G.3 Mathematics of Computing: Probability and Statistics General Terms: Algorithms. Keywords: User Model, Markov Chain to transition from one section of the advertising network to another based on a random yet know probability transition matrix. The traditional approach to frequency capping is to use cross-site cookies to track users through the web properties where the advertising network is serving ads. The cookies are used to keep a count of the number of ads the user has seen. When the user has reached the maximum daily caps, no further ads are shown. However, there has been growing concern over the privacy issues associated with tracking the user across multiple sites. Furthermore,up to 33 % of the users delete their cookies making cookie based approach unreliable . We propose a novel algorithm that can be used to insure that the frequency caps are fulﬁlled in expectation. The approach is based on formulating a linear optimization program that maximizes the expected number of ads seen by the user subject to the frequency caps constraints. The solution to the linear program gives a set of probabilistic weights used by the ad server to decide whether to serve the ad when a user arrives at a speciﬁc web page.
About this site
This website has been set up for WWW2009 by Christopher Gutteridge of the University of Southampton, using our EPrints software.
We (Southampton EPrints Project) intend to preserve the files and HTML pages of this site for many years, however we will turn it into flat files for long term preservation. This means that at some point in the months after the conference the search, metadata-export, JSON interface, OAI etc. will be disabled as we "fossilize" the site. Please plan accordingly. Feel free to ask nicely for us to keep the dynamic site online longer if there's a rally good (or cool) use for it... [this has now happened, this site is now static]