Analysis of a very large web search engine query log
ACM SIGIR Forum
Multi-unit auctions with budget-constrained bidders
Proceedings of the 6th ACM conference on Electronic commerce
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Revenue maximization when bidders have budgets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Truthful auctions for pricing search keywords
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Selected Topics in Column Generation
Operations Research
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Finding dense and isolated submarkets in a sponsored search spending graph
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
Proceedings of the 17th international conference on World Wide Web
On the Hardness of Truthful Online Auctions with Multidimensional Constraints
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Truthful Mechanism for Offline Ad Slot Scheduling
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Sponsored Search Auctions with Reserve Prices: Going Beyond Separability
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Personalized Delivery of On---Line Search Advertisement Based on User Interests
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Computational analysis of perfect-information position auctions
Proceedings of the 10th ACM conference on Electronic commerce
Optimal Auctions Capturing Constraints in Sponsored Search
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Expressive banner ad auctions and model-based online optimization for clearing
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Personalized ad delivery when ads fatigue: an approximation algorithm
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
ACM Transactions on Internet Technology (TOIT)
Keyword auction protocol for dynamically adjusting the number of advertisements
Web Intelligence and Agent Systems
OR PRACTICE---Scheduling of Dynamic In-Game Advertising
Operations Research
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
Proceedings of the 12th ACM conference on Electronic commerce
Advertisement allocation for generalized second-pricing schemes
Operations Research Letters
A unified optimization framework for auction and guaranteed delivery in online advertising
Proceedings of the 21st ACM international conference on Information and knowledge management
Maximizing revenue from strategic recommendations under decaying trust
Proceedings of the 21st ACM international conference on Information and knowledge management
Budget smoothing for internet ad auctions: a game theoretic approach
Proceedings of the fourteenth ACM conference on Electronic commerce
Balanced allocation mechanism: An optimal mechanism for multiple keywords sponsored search auctions
Information Sciences: an International Journal
| Hi-index | 0.00 |
We discuss an auction framework in which sponsored search advertisements are delivered in response to queries. In practice, the presence of bidder budgets can have a significant impact on the ad delivery process. We propose an approach based on linear programming which takes bidder budgets into account, and uses them in conjunction with forecasting of query frequencies, and pricing and ranking schemes, to optimize ad delivery. Simulations show significant improvements in revenue and efficiency.