Multi-agent task allocation method based on the cost-effectiveness maximization multi-round auction algorithm

Multi-agent task allocation plays a crucial role in achieving efficient collaboration in heterogeneous multi-agent systems, especially in complex and dynamic environments. However, existing auction-based task allocation approaches often focus primarily on economic optimization or bid-oriented allocation while insufficiently considering the compatibility between agent capabilities and task attribute requirements, along with the overall cost-effectiveness from the task owner’s perspective. To address these limitations, in this paper, we propose a task allocation framework, which integrates task fitness modeling with cost-effectiveness maximization, and further develop a distributed multi-round auction mechanism. In particular, a task fitness model is constructed to quantitatively evaluate the suitability of agents for different tasks by combining multiple capability dimensions, where the importance of different task attributes is determined using the analytic hierarchy process (AHP). Based on this, a cost-effectiveness metric is defined by jointly considering agent bids and task fitness, and a multi-round auction algorithm, with dynamic bidding and an improved payment rule, is designed to maximize the overall task cost-effectiveness while ensuring incentive compatibility and individual rationality. Extensive simulation results demonstrate that the proposed approach significantly improves task cost-effectiveness and maintains high task execution suitability compared with conventional first-price, second-price, and existing multi-round auction mechanisms.

Authors

Institutions

Publication Details

Journal
Frontiers in Physics
Published
2026-02-24
DOI
https://doi.org/10.3389/fphy.2025.1617607
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-agent task allocation method based on the cost-effectiveness maximization multi-round auction algorithm

Luda Wang, Yu Zhou, Ting Lyu, Xuan Yang et al.
Frontiers in Physics
Distributed and Parallel Computing Systems
article

Multi-agent task allocation method based on the cost-effectiveness maximization multi-round auction algorithm

Luda Wang, Yu Zhou, Ting Lyu, Xuan Yang, Guowei Li, Shuguang Li, Qing Lan
article en

Abstract

Multi-agent task allocation plays a crucial role in achieving efficient collaboration in heterogeneous multi-agent systems, especially in complex and dynamic environments. However, existing auction-based task allocation approaches often focus primarily on economic optimization or bid-oriented allocation while insufficiently considering the compatibility between agent capabilities and task attribute requirements, along with the overall cost-effectiveness from the task owner’s perspective. To address these limitations, in this paper, we propose a task allocation framework, which integrates task fitness modeling with cost-effectiveness maximization, and further develop a distributed multi-round auction mechanism. In particular, a task fitness model is constructed to quantitatively evaluate the suitability of agents for different tasks by combining multiple capability dimensions, where the importance of different task attributes is determined using the analytic hierarchy process (AHP). Based on this, a cost-effectiveness metric is defined by jointly considering agent bids and task fitness, and a multi-round auction algorithm, with dynamic bidding and an improved payment rule, is designed to maximize the overall task cost-effectiveness while ensuring incentive compatibility and individual rationality. Extensive simulation results demonstrate that the proposed approach significantly improves task cost-effectiveness and maintains high task execution suitability compared with conventional first-price, second-price, and existing multi-round auction mechanisms.

Frontiers in PhysicsVol. 13
Institute of Computing Technology (CN), University of Science and Technology Beijing (CN)
Partnerships for the goals
Openalex Percentile: Top 53%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.