Papers
Topics
Authors
Recent
Search
2000 character limit reached

Online Allocation Rules in Display Advertising

Published 22 Jul 2014 in math.OC | (1407.5710v1)

Abstract: Efficient allocation of impressions to advertisers in display advertising has a significant impact on advertisers' utility and the browsing experience of users. The problem becomes particularly challenging in the presence of advertisers with limited budgets as this creates a complex interaction among advertisers in the optimal impression assignment. In this paper, we study online impression allocation in display advertising with budgeted advertisers. That is, upon arrival of each impression, cost and revenue vectors are revealed and the impression should be assigned to an advertiser almost immediately. Without any assumption on the distribution/arrival of impressions, we propose a framework to capture the risk to the ad network for each possible allocation; impressions are allocated to advertisers such that the risk of ad network is minimized. In practice, this translates to starting with an initial estimate of dual prices and updating them according to the belief of the ad network toward the future demand and remaining budgets. We apply our algorithms to a real data set, and we empirically show that Kullback-Leibler divergence risk measure has the best performance in terms of revenue and balanced budget delivery.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.