SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising

Details SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising

2012-03-16

arxiv.org/abs/1203.3619v1

Computer Science

Data Structures and Algorithms

Scientific paper

Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(1) state per guaranteed contract, is robust to noise, and allows us to serve (provably) nearly optimally. The optimization method we develop is scalable, with a small in-memory footprint, and working in linear time per iteration. It is also "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution. Thus, it is particularly useful for optimizing the large problems arising in the context of display advertising. We demonstrate the effectiveness of our algorithm using actual Yahoo! data.

Affiliated with

Also associated with

No associations

Rating

SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349386