Online Submodular Welfare Maximization: Greedy is Optimal

We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2-competitive for welfare maximization with coverage valuations, unless NP = RP. Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, we prove that Greedy in a stochastic setting with i.i.d. items and valuations satisfying diminishing returns is (1−1/e)-competitive, which is optimal even for coverage valuations, unless NP = RP. For online budget-additive allocation, we prove that no algorithm can be 0.612-competitive with respect to a natural LP which has been used previously for this problem.

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

[2]  SaberiAmin,et al.  AdWords and generalized online matching , 2007 .

[3]  Morteza Zadimoghaddam,et al.  Simultaneous approximations for adversarial and stochastic online budgeted allocation , 2012, SODA.

[4]  Amin Saberi,et al.  Online stochastic matching: online actions based on offline statistics , 2010, SODA '11.

[5]  Nikhil R. Devanur,et al.  Near optimal online algorithms and fast approximation algorithms for resource allocation problems , 2011, EC '11.

[6]  Uriel Feige,et al.  On maximizing welfare when utility functions are subadditive , 2006, STOC '06.

[7]  Vijay Kumar,et al.  Approximation Algorithms for Budget-Constrained Auctions , 2001, RANDOM-APPROX.

[8]  Laurence A. Wolsey,et al.  Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..

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

[10]  Uriel Feige,et al.  The Submodular Welfare Problem with Demand Queries , 2010, Theory Comput..

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

[12]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[13]  László Lovász,et al.  Approximating Min Sum Set Cover , 2004, Algorithmica.

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

[15]  Gagan Goel,et al.  On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Mikhail Kapralov,et al.  Improved Bounds for Online Stochastic Matching , 2010, ESA.

[17]  Gagan Goel,et al.  Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations , 2010, SODA.

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

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

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

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

[22]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.