Timezone: »

 
Poster
Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions
Wei Zhang · Yanjun Han · Zhengyuan Zhou · Aaron Flores · Tsachy Weissman

Wed Nov 30 09:00 AM -- 11:00 AM (PST) @ Hall J #326
in Poster Session 3 »

With the advent and increasing consolidation of e-commerce, digital advertising has very recently replaced traditional advertising as the main marketing force in the economy. In the past four years, a particularly important development in the digital advertising industry is the shift from second-price auctions to first-price auctions for online display ads. This shift immediately motivated the intellectually challenging question of how to bid in first-price auctions, because unlike in second-price auctions, bidding one's private value truthfully is no longer optimal. Following a series of recent works in this area, we consider a differentiated setup: we do not make any assumption about other bidders' maximum bid (i.e. it can be adversarial over time), and instead assume that we have access to a hint that serves as a prediction of other bidders' maximum bid, where the prediction is learned through some blackbox machine learning model. We consider two types of hints: one where a single point-prediction is available, and the other where a hint interval (representing a type of confidence region into which others' maximum bid falls) is available. We establish minimax optimal regret bounds for both cases and highlight the quantitatively different behavior between the two settings. We also provide improved regret bounds when the others' maximum bid exhibits the further structure of sparsity. Finally, we complement the theoretical results with demonstrations using real bidding data.

Keywords: Online Learning · bandit · first-price auction

Author Information

Wei Zhang (Massachusetts Institute of Technology)
Yanjun Han (Massachusetts Institute of Technology)
Zhengyuan Zhou (Arena Technologies & NYU)
Aaron Flores
Tsachy Weissman (Stanford University)

More from the Same Authors