Assignment problems are combinatorial optimization problems where agents need to be assigned to tasks while maximizing utility and satisfying constraints.
Multi-agent reinforcement learning (MARL) is applied to solve assignment problems that unfold over time.
The algorithm uses bootstrapping from a polynomial-time greedy solver and further experience to learn the value of assignments.
The distributed optimal assignment mechanism is employed to choose assignments.