Multi agent negotiation model for distributed task allocation

In the multi agent system, negotiation between different agents becomes more and more complex when the distributed tasks need to be allocated among them. Usually, this process has been done in the centralized way where agents have all the information of both the tasks and the environment. However, in the real application such as satellite scheduling problem or production scheduling problem, not all the information can be acquired, some of them even cannot be known. Therefore, in this paper, we propose a multi agent negotiation model for distributed task allocation in a priority based environment. This process is modeled as a finite Markov Decision Process (F-MDP), and a coordinated negotiation protocol is also suggested to support the model. The experiments show that tasks are allocated in an efficient way, and it can also reduce the communication cost.