arrow
Return

QFree: a universal value function factorisation for multi-agent reinforcement learning

delete2026-03-01
delete0
PRE
AI
R
Rizhong Wang
L
Li, Huiping *
C
Cui, Di
X
Xu, Demin
DOI:10.1080/23307706.2025.2601691delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Centralized training is widely utilised in the field of multi-agent reinforcement learning (MARL) to assure the stability of training process. Once a joint policy is obtained, it is critical to design a value function factorisation method to extract optimal decentralised policies for the agents, which needs to satisfy the individual-global-max (IGM) principle. While imposing additional limitations on the IGM function class can help to meet the requirement, it comes at the cost of restricting its application to more complex multi-agent environments. In this paper, we propose QFree, a universal value function factorisation method for MARL. We start by developing mathematical equivalent conditions of the IGM principle based on the advantage function, which ensures that the principle holds without any compromise, removing the conservatism of conventional methods. We then establish a more expressive mixing network architecture that can fulfill the equivalent factorisation. In particular, the novel loss function is developed by considering the equivalent conditions as regularisation term during policy evaluation in the MARL algorithm. Finally, the effectiveness of the proposed method is verified in a nonmonotonic matrix game scenario. Moreover, we show that QFree achieves the state-of-the-art performance in a general-purpose complex MARL benchmark environment, Starcraft Multi-Agent Challenge (SMAC).
Keywords:
Multi-agent reinforcement learning
value function factorisation method
individual-global-max principle
advantage function

Journal

Journal of Control and Decision cover
Journal of Control and Decision
IF:
1.8
Papers:
133
Citations:
724

Organization

N
northwestern polytechnical university
Scholars:
1.1W
Papers: 4.0K
Citations: 0