Revenue analysis of a family of ranking rules for keyword 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
Simulation-based game theoretic analysis of keyword auctions with low-dimensional bidding strategies
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
| Hi-index | 0.00 |
Keyword auctions account for an enormous proportion of revenue for the major search engines. Consequently, substantial literature analyzing alternative auction designs has sprouted in recent years. We contribute to this growing literature by engaging in a simulation-based analysis of strategic interactions in keyword auctions which are difficult to analyze in closed form. In this letter we provide an overview of two specific efforts in this direction. The first effort presents analysis of the dynamic bidding strategies, while the second effort is performed in a static context, but involves a close analysis of several classes of Bayesian bidding strategies. Both these efforts attempt to bridge the gap between the mostly theoretical literature to date and real auctions.