On Revenue Maximization in Second-Price Ad Auctions

Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first-price auction, which does not realistically model the Generalized Second Price (GSP) auction used in practice. Towards the goal of more realistically modeling these auctions, we introduce the Second-Price Ad Auctions problem, in which bidders’ payments are determined by the GSP mechanism. We show that the complexity of the Second-Price Ad Auctions problem is quite different than that of the more studied First-Price Ad Auctions problem. First, unlike the first-price variant, for which small constant-factor approximations are known, it is NP-hard to approximate the Second-Price Ad Auctions problem to any non-trivial factor. Second, this discrepancy extends even to the 0-1 special case that we call the Second-Price Matching problem (2PM). In particular, offline 2PM is APX-hard, and for online 2PM there is no deterministic algorithm achieving a non-trivial competitive ratio and no randomized algorithm achieving a competitive ratio better than 2. This stands in contrast to the results for the analogous special case in the first-price model, the standard bipartite matching problem, which is solvable in polynomial time and which has deterministic and randomized online algorithms achieving better competitive ratios. On the positive side, we provide a 2-approximation for offline 2PM and a 5.083-competitive randomized algorithm for online 2PM. The latter result makes use of a new generalization of a classic result on the performance of the “Ranking” algorithm for online bipartite matching.

[1]  Claire Mathieu,et al.  Improved Approximation Algorithms for Budgeted Allocations , 2008, ICALP.

[2]  R. Vohra,et al.  Algorithmic Game Theory: Sponsored Search Auctions , 2007 .

[3]  Vahab S. Mirrokni,et al.  Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.

[4]  Aranyak Mehta,et al.  Online budgeted matching in random input models with applications to Adwords , 2008, SODA '08.

[5]  Ashish Goel,et al.  Advertisement allocation for generalized second-pricing schemes , 2010, Oper. Res. Lett..

[6]  Sanjeev Khanna,et al.  A PTAS for the multiple knapsack problem , 2000, SODA '00.

[7]  Yishay Mansour,et al.  Auctions with Budget Constraints , 2004, SWAT.

[8]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

[9]  John Tomlin,et al.  Optimal delivery of sponsored search advertisements subject to budget constraints , 2007, EC '07.

[10]  V. Mirrokni,et al.  Tight approximation algorithms for maximum general assignment problems , 2006, SODA 2006.

[11]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

[12]  Shahar Dobzinski,et al.  An improved approximation algorithm for combinatorial auctions with submodular bidders , 2006, SODA '06.

[13]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[14]  Thomas P. Hayes,et al.  The adwords problem: online keyword matching with budgeted bidders under random permutations , 2009, EC '09.

[15]  Aranyak Mehta,et al.  Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions , 2005, Algorithmica.

[16]  Uriel Feige,et al.  Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[17]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[18]  Claire Mathieu,et al.  On-line bipartite matching made simple , 2008, SIGA.

[19]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[20]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[21]  Jan Vondrák,et al.  Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.

[22]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[23]  Aravind Srinivasan,et al.  Budgeted Allocations in the Full-Information Setting , 2008, APPROX-RANDOM.

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

[25]  Gagan Goel,et al.  On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2010, SIAM J. Comput..

[26]  Max Planck,et al.  Complexity of approximating bounded variants of optimization problems , 2008 .