Ad auctions with data

Hu Fu, Patrick R. Jordan, Mohammad Mahdian, Uri Nadav, Inbal Talgam-Cohen, Sergei Vassilvitskii

Abstract: The holy grail of online advertising is to target users with ads matched to their needs with such precision that the users respond to the ads, thereby increasing both advertisers' and users' value. The current approach to this challenge utilizes information about the users: their gender, their location, the websites they have visited before, and so on. Incorporating this data in ad auctions poses an economic challenge: can this be done in a way that the auctioneer's revenue does not decrease (at least on average)? This is the problem we study in this paper. Our main result is that in Myerson's optimal mechanism, additional data leads to additional revenue. However in simpler auctions, namely the second price auction with reserve prices, there are instances in which additional data decreases the revenue, albeit by only a small constant factor.