SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Multi-unit auctions with budget-constrained bidders
Proceedings of the 6th ACM conference on Electronic commerce
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Interpreting the data: Parallel analysis with Sawzall
Scientific Programming - Dynamic Grids and Worldwide Computing
Dynamics of bid optimization in online advertisement auctions
Proceedings of the 16th international conference on World Wide Web
Budget optimization in search-based advertising auctions
Proceedings of the 8th ACM conference on Electronic commerce
Greedy bidding strategies for keyword auctions
Proceedings of the 8th ACM conference on Electronic commerce
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
AdWords and generalized online matching
Journal of the ACM (JACM)
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal bidding in stochastic budget constrained slot auctions
Proceedings of the 9th ACM conference on Electronic commerce
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Online Ad Assignment with Free Disposal
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Optimal online assignment with forecasts
Proceedings of the 11th ACM conference on Electronic commerce
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
Proceedings of the 11th ACM conference on Electronic commerce
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Real-time bidding algorithms for performance-based display ad allocation
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
Search engine ad auctions typically have a significant fraction of advertisers who are budget constrained, i.e., if allowed to participate in every auction that they bid on, they would spend more than their budget. This yields an important problem: selecting the ad auctions which these advertisers participate, in order to optimize different system objectives such as the return on investment for advertisers, and the quality of ads shown to users. We present a system and algorithms for optimizing budget constrained spend. The system is designed be deployed in a large search engine, with hundreds of thousands of advertisers, millions of searches per hour, and with the query stream being only partially predictable. We have validated the system design by implementing it in the Google ads serving system and running experiments on live traffic. We have also compared our algorithm to previous work that casts this problem as a large linear programming problem limited to popular queries, and show that our algorithms yield substantially better results.