Theory of linear and integer programming
Theory of linear and integer programming
Paid placement strategies for internet search engines
Proceedings of the 11th international conference on World Wide Web
Improvements to the Linear Programming Based Scheduling of Web Advertisements
Electronic Commerce Research
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
Truthful and Near-Optimal Mechanism Design via Linear Programming
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
Dynamics of bid optimization in online advertisement auctions
Proceedings of the 16th international conference on World Wide Web
Optimal delivery of sponsored search advertisements subject to budget constraints
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
Algorithmic Game Theory
New Stochastic Algorithms for Scheduling Ads in Sponsored Search
LA-WEB '07 Proceedings of the 2007 Latin American Web Conference
Externalities in online advertising
Proceedings of the 17th international conference on World Wide Web
Truthful Stochastic and Deterministic Auctions for Sponsored Search
LA-WEB '08 Proceedings of the 2008 Latin American Web Conference
| Hi-index | 0.01 |
Most sponsored search auctions use the Generalized Second Price (GSP) rule. Given the GSP rule, they try to give an optimal allocation, an easy task when the only need is to allocate ads to slots. However, when other practical conditions must be fulfilled ---such as budget constraints, exploration of the performance of new ads, etc.--- optimal allocations are hard to obtain. We provide a method to optimally allocate ads to slots under the practical conditions mentioned above. Our auctions are stochastic, and can be applied in tandem with different pricing rules, among which we highlight two: an intuitive generalization of GSP and VCG payments.