Searched for:
(1 - 1 of 1)
document
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net...
conference paper 2007