- 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 NP-complete. Moreover, it is not approximable within some factor. In contrast to this, we develop an efficient greedy...journal article 2011