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...
We present a characterization of empirical price data from sponsored search auctions. We show that simple models drawing bid values independently from a fixed distribution can be...
Kuzman Ganchev, Alex Kulesza, Jinsong Tan, Ryan Ga...
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...
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...