Learning optimally from self-interested data sources in on-line ad auctions
published: Dec. 20, 2008, recorded: December 2008, views: 173
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
In the analysis of current online ad auctions essential parameters such as click-through rates are often assumed to be known. The disregard of the uncertainty that is present in reality leads to several serious problems. In the talk we will highlight two: (i) there is no principled exploration of new ads, and (ii) there is no incentive for advertisers to only subscribe to well targeted key-words. In fact, there is an interesting opportunity for very poorly targeting advertisers to exploit this fact. We present a new auction that solves both problems. The key trick for this auction is that advertisers are not only requested to submit a bid, but also a belief over their own click-through rate.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !