Reviews: Bi-Objective Online Matching and Submodular Allocations

The paper builds on the following problem. There is a set of agents. Each agent a is associated a submodular function f_a. Elements from the universe arrive over time. When an element arrives, it is to be assigned to an agent.