Skip to main content
placeholder image

An auction-based approach for group task allocation in an open network environment

Journal Article


Abstract


  • To solve the problem of group task allocation with time constraints in open and dynamic network environments, this paper proposes a decentralized combinatorial auction-based approach for group task allocation. In the proposed approach, both resource providers and consumers are modeled as intelligent agents. The proposed approach is decentralized, so all the agents are limited to communicating with their neighboring agents. The proposed approach also allows agents to enter and leave the network environments freely, and is robust for the dynamism and openness of the network environments. Tasks in the proposed approach have deadlines, and may need the collaboration of a group of self-interested providers. The experimental results demonstrate that the proposed approach outperforms two well-known task allocation approaches in terms of success rate of task allocation, the individual utility of the agents, the speed of task allocation and scalability.

UOW Authors


  •   Kong, Yan (external author)
  •   Zhang, Minjie
  •   Ye, Dayong (external author)

Publication Date


  • 2016

Citation


  • Kong, Y., Zhang, M. & Ye, D. (2016). An auction-based approach for group task allocation in an open network environment. The Computer Journal, 59 (3), 403-422.

Scopus Eid


  • 2-s2.0-84961256227

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/5380

Number Of Pages


  • 19

Start Page


  • 403

End Page


  • 422

Volume


  • 59

Issue


  • 3

Abstract


  • To solve the problem of group task allocation with time constraints in open and dynamic network environments, this paper proposes a decentralized combinatorial auction-based approach for group task allocation. In the proposed approach, both resource providers and consumers are modeled as intelligent agents. The proposed approach is decentralized, so all the agents are limited to communicating with their neighboring agents. The proposed approach also allows agents to enter and leave the network environments freely, and is robust for the dynamism and openness of the network environments. Tasks in the proposed approach have deadlines, and may need the collaboration of a group of self-interested providers. The experimental results demonstrate that the proposed approach outperforms two well-known task allocation approaches in terms of success rate of task allocation, the individual utility of the agents, the speed of task allocation and scalability.

UOW Authors


  •   Kong, Yan (external author)
  •   Zhang, Minjie
  •   Ye, Dayong (external author)

Publication Date


  • 2016

Citation


  • Kong, Y., Zhang, M. & Ye, D. (2016). An auction-based approach for group task allocation in an open network environment. The Computer Journal, 59 (3), 403-422.

Scopus Eid


  • 2-s2.0-84961256227

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers/5380

Number Of Pages


  • 19

Start Page


  • 403

End Page


  • 422

Volume


  • 59

Issue


  • 3