We study keyword auctions in a model where each advertiser has a value for every slot, which is not necessarily proportional to the number of clicks the advertiser expects to rece...
We consider the problem of designing auctions with worst case revenue guarantees for sponsored search. This problem differs from previous work because of ad dependent clickthroug...
Sponsored search auction is used by most search engines to select ads to display on the web page of a search result, according to advertisers’ bidding prices. The income of this ...
Proxy bidding has been proposed for combinatorial auctions as a means to speed up the auctions, to simplify the user interface, and to limit strategic behavior. The only previousl...
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...