Discrete consensus for asynchronous distributed task assignment

This paper deals with the problem of assigning tasks to a set of nodes communicating in a connected graph topology to satisfy the following requirements: assigning all the tasks to the agents; assigning to each agent no more than M tasks; minimizing the maximum total load of each agent. A gossip-bas... View More