The problem of Submodular Welfare Maximization (SWM) captures an important subclass of combinatorial auctions and has been studied extensively from both computational and economic perspectives. In particular, it has been studied in a natural online setting in which items arrive one-by-one and should be allocated irrevocably upon arrival. In this setting, it is well known that the greedy algorithm achieves a competitive ratio of, and recently Kapralov et al. [22] showed that this ratio is optimal for the problem. Surprisingly, despite this impossibility result, Korula et al. [25] were able to show that the same algorithm is 0.5052-competitive when the items arrive in a uniformly random order, but unfortunately, their proof is very long and involved. In this work, we present an (arguably) much simpler analysis that provides a slightly better guarantee of 0.5096-competitiveness for the greedy algorithm in the random-arrival model. Moreover, this analysis applies also to a generalization of online SWM in which the sets defining a (simple) partition matroid arrive online in a uniformly random order, and we would like to maximize a monotone submodular function subject to this matroid. Furthermore, for this more general problem, we prove an upper bound of 0.576 on the competitive ratio of the greedy algorithm, ruling out the possibility that the competitiveness of this natural algorithm matches the optimal offline approximation ratio of.
CITATION STYLE
Buchbinder, N., Feldman, M., Filmus, Y., & Garg, M. (2019). Online Submodular Maximization: Beating 1/2 Made Simple. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11480 LNCS, pp. 101–114). Springer Verlag. https://doi.org/10.1007/978-3-030-17953-3_8
Mendeley helps you to discover research relevant for your work.