Real-time bidding algorithms for performance-based display ad allocation

  title={Real-time bidding algorithms for performance-based display ad allocation},
  author={Ye Chen and Pavel Berkhin and Bo Anderson and Nikhil R. Devanur},
We describe a real-time bidding algorithm for performance-based display ad allocation. A central issue in performance display advertising is matching campaigns to ad impressions, which can be formulated as a constrained optimization problem that maximizes revenue subject to constraints such as budget limits and inventory availability. The current practice is to solve the optimization problem offline at a tractable level of impression granularity (e.g., the page level), and to serve ads online… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 60 extracted citations

Matching and Ad Allocation By

View 5 Excerpts
Highly Influenced

Truthfulness in advertising? Approximation mechanisms for knapsack bidders

European Journal of Operational Research • 2018
View 5 Excerpts
Highly Influenced

Ad Serving with Multiple KPIs

View 4 Excerpts
Highly Influenced

Bidding Machine: Learning to Bid for Directly Optimizing Profits in Display Advertising

IEEE Transactions on Knowledge and Data Engineering • 2018
View 2 Excerpts

87 Citations

Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.

Ad Exchanges: Research Issues

WINE • 2009
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…