Bid optimization for broad match ad auctions

Ad auctions in sponsored search support "broad match" that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the {\em bid optimization problem} which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present a linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any reasonable approximation factor unless P=NP. To deal with this hardness result, we present a constant-factor approximation when the optimal profit significantly exceeds the cost. This algorithm is based on rounding a natural LP formulation of the problem. Finally, we study a budgeted variant of the problem, and show that in the query language model, one can find two budget constrained ad campaigns in polynomial time that implement the optimal bidding strategy. Our results are the first to address bid optimization under the broad match feature which is common in ad auctions.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[3]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[4]  Mechthild Stoer,et al.  A simple min-cut algorithm , 1997, JACM.

[5]  U. Feige A threshold of ln n for approximating set cover , 1998, JACM.

[6]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[7]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[8]  Nicole Immorlica,et al.  Multi-unit auctions with budget-constrained bidders , 2005, EC '05.

[9]  David P. Williamson,et al.  An adaptive algorithm for selecting profitable keywords for search-based advertising services , 2006, EC '06.

[10]  Ashish Goel,et al.  Truthful auctions for pricing search keywords , 2006, EC '06.

[11]  Jason D. Hartline,et al.  Knapsack auctions , 2006, SODA '06.

[12]  Jon Feldman,et al.  Budget optimization in search-based advertising auctions , 2006, EC '07.

[13]  Nicole Immorlica,et al.  Dynamics of bid optimization in online advertisement auctions , 2007, WWW '07.

[14]  Glenn Ellison,et al.  Position Auctions with Consumer Search , 2007 .

[15]  Amin Saberi,et al.  Allocating online advertisement space with unreliable estimates , 2007, EC '07.

[16]  Deeparnab Chakrabarty,et al.  Budget constrained bidding in keyword auctions and online knapsack problems , 2008, WINE.

[17]  Joseph Y. Halpern,et al.  Toward Expressive and Scalable Sponsored Search Auctions , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[18]  S. Muthukrishnan,et al.  Stochastic Models for Budget Optimization in Search-Based Advertising , 2006, Algorithmica.