Sciweavers

21 search results - page 1 / 5
» Bid optimization for broad match ad auctions
Sort
View
WWW
2009
ACM
14 years 5 months ago
Bid optimization for broad match ad auctions
Ad auctions in sponsored search support"broad match"that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving mo...
Eyal Even-Dar, Vahab S. Mirrokni, S. Muthukrishnan...
CORR
2008
Springer
170views Education» more  CORR 2008»
13 years 4 months ago
To Broad-Match or Not to Broad-Match : An Auctioneer's Dilemma ?
We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match- a feature where an ad of an advertiser can be mapped to a b...
Sudhir Kumar Singh, Vwani P. Roychowdhury
ACMICEC
2007
ACM
220views ECommerce» more  ACMICEC 2007»
13 years 8 months ago
Asymptotically optimal repeated auctions for sponsored search
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
Nicolas S. Lambert, Yoav Shoham
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
13 years 9 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
ATAL
2010
Springer
13 years 5 months ago
TacTex09: a champion bidding agent for ad auctions
In the Trading Agent Competition Ad Auctions Game, agents compete to sell products by bidding to have their ads shown in a search engine's sponsored search results. We report...
David Pardoe, Doran Chakraborty, Peter Stone