(A) game-theoretic approach for coupled-constraint task allocation

Abstract

Multi-agent multi-task decentralized allocation is a well-studied field with many proven algorithms. In the real world, many tasks have complicated coupled relationships that affect the feasibility of some algorithms. In this thesis, we consider an agent-task allocation problem where agents greedily assign themselves to a set of tasks with spatial and/or temporal constraints. Due to the coupled nature of the tasks, cooperation between the agents is necessary. We formulate the coupled-constraint task allocation problem as an exact potential game and show that it can converge to a Nash equilibrium.