I. Introduction
We consider a dynamic task allocation problem for a multi-agent system whose agents have continuous state and input spaces and have to complete a set of spatially distributed tasks (obtain in-situ measurements or pick up packages from different locations over a given spatial domain). We adopt a game-theoretic approach which seeks for task assignments that maximize the individual utility of each agent conditional on the assignments of their teammates (individual rationality principle) while also ensuring that the self-interests of the agents are aligned with those of the team. To this aim, we design the agents' utilities based on the concept of wonderful life utility [1] (WLU) which allows us to associate the dynamic task allocation problem with a sequence of potential games [2]. We propose a greedy decentralized algorithm that computes task assignment profiles which are mutually agreeable in the long run.