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

作者: Nicholas Harvey, Christopher Liaw, Tasuku Soma

摘要

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

PDF打开原文