Sciweavers

4 search results - page 1 / 1
» To Broad-Match or Not to Broad-Match : An Auctioneer's Dilem...
Sort
View
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
WWW
2009
ACM
14 years 4 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...
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
13 years 8 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
WINE
2009
Springer
194views Economy» more  WINE 2009»
13 years 10 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi