An efficient algorithm for task allocation with the budget constraint

作者：

Highlights：

• The objective in task allocation is aligned with Nash equilibrium in game theory.

• The proposed algorithm can be used as a local search algorithm.

• The proposed algorithm guarantees the return of a valid Nash equilibrium solution.

• The proposed algorithm is an “anytime” and “monotonic” algorithm.

• The proposed algorithm is computationally efficient and highly scalable.

摘要

•The objective in task allocation is aligned with Nash equilibrium in game theory.•The proposed algorithm can be used as a local search algorithm.•The proposed algorithm guarantees the return of a valid Nash equilibrium solution.•The proposed algorithm is an “anytime” and “monotonic” algorithm.•The proposed algorithm is computationally efficient and highly scalable.

论文关键词：Heterogeneous task allocation,Budget constraint,Large-scale,Nash equilibrium,Anytime monotonic

论文评审过程：Received 19 March 2021, Revised 21 July 2022, Accepted 22 July 2022, Available online 2 August 2022, Version of Record 19 August 2022.

论文官网地址：https://doi.org/10.1016/j.eswa.2022.118279