The traditional overlapping coalition formation problems mostly focus on agents rather than tasks.In this work,a new model of task-oriented overlapping coalition structure(OCS)generation is first presented.Next,the solution space and the computational complexity of the proposed model are analyzed.Then,the checking algorithms for non-overlapping coalitions,overlapping coalitions,and OCS and the search algorithm for the optimal OCS are developed based on the flow network,respectively.The analysis results show that checking whether non-overlapping coalitions,overlapping coalitions,or OCS is successful is in time polynomial in the number of agents and tasks,but finding the optimal OCS is in time exponential in the number of agents and tasks.Finally,the simulation and experimental results demonstrate the above properties.
维普
万方数据