Multiagent task allocation in social networks

  title={Multiagent task allocation in social networks},
  author={Mathijs de Weerdt and Yingqian Zhang and Tomas Klos},
  journal={Autonomous Agents and Multi-Agent Systems},
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 algorithm… CONTINUE READING