Before revision: We consider the problem of allocating a set of divisible goods to N agents in an online manner over T periods, with adversarially-chosen normalized valuations in each period. Our goal is to maximize the Nash social welfare, a widely studied objective which provides a balance between fairness and efficiency.
After revision: We consider the problem of allocating a set of divisible goods to N agents in an online manner , aiming to maximize the Nash social welfare, a widely studied objective which provides a balance between fairness and efficiency.