Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds

Authors: Nicholas Harvey, Christopher Liaw, Tasuku Soma

Abstract

We consider the problem of nonnegative submodular maximization in the online setting. At time step t, an algorithm selects a set S

PDFOpen original