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 analysis of alternative slot auction designs for sponsored search
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Co-evolution-based mechanism design for sponsored search advertising
Electronic Commerce Research and Applications
| Hi-index | 0.00 |
Search engines such as Google, Yahoo, and MSN now auction off search terms to potential advertisers. The potential advertisers place their bids on each search term of interest, as well as specifying a daily budget. Each search on this term displays an advertisement that is linked to the advertiser's website, and the advertiser pays the search engine every time the link is activated. When an advertiser's budget is reached, the search engine stops displaying their ad. This kind of advertising is extremely popular -- the combined revenue of Yahoo and Google in 2005 was estimated at over 4.5 billion dollars. We develop small models which still have the property that malicious behavior such as bid-jamming still occurs as a rational best-response strategy. Such malicious behavior occurs frequently in practice. We are able to derive bidding strategies which are the best-responses when the budget of the bidder is low relative to her competitors, as well as strategies which protect against bid-jamming.