Fast Core Pricing for Rich Advertising Auctions

Standard ad auction formats do not immediately extend to settings where multiple size configurations and layouts are available to advertisers. In these settings, the sale of web advertising space increasingly resembles a combinatorial auction with complementarities, where truthful auctions such as the Vickrey–Clarke–Groves (VCG) auction can yield unacceptably low revenue. In “Fast Core Pricing for Rich Advertising Auctions,” Niazadeh, Hartline, Immorlica, Khani, and Lucier study and suggest core-selecting auctions, which boost revenue by setting payments so that no group of agents, including the auctioneer, can jointly improve their utilities by switching to a different outcome. Their main result is a combinatorial algorithm that finds an approximate bidder-optimal core point with an almost linear number of calls to the welfare-maximization oracle. This algorithm is faster than previously proposed heuristics in the literature and has theoretical guarantees. By accompanying the theoretical study with an experimental study based on Microsoft Bing Ad Auction data, the authors conclude that core pricing is implementable even for very time-sensitive practical use cases such as real-time online advertising and can yield more revenue than the VCG or generalized second price auction.