{"title":"Extended mean field game theoretical optimal distributed control for large scale multi-agent systems: An efficiency-complexity tradeoff","authors":"Shawon Dey, Hao Xu","doi":"10.1016/j.ins.2025.122432","DOIUrl":null,"url":null,"abstract":"<div><div>This paper investigates the tradeoff between optimal efficiency and computational complexity in the emerging mean-field game (MFG) theory and further develops a novel reconfigurable decomposition approach that can balance the efficiency-complexity of MFG theoretical optimal distributed control for large-scale multi-agent systems (LS-MAS). Generally, the MFG has the potential to overcome the “Curse of Dimensionality” in LS-MAS control by simplifying all agents' interactions into ones between individual agents and the collective average effects captured by the group's probability density function (PDF). However, the social cost associated with MFG Nash equilibria is generally inefficient compared to the centralized optimal cost associated with the McKean-Vlasov control problem. To enhance the efficiency of MFG theoretical control without significantly increasing complexity, a novel extended MFG (EMFG) is developed to efficiently balance the MFG efficiency and computational complexity through a decomposed mean field PDF term. Specifically, LS-MAS is divided into multiple groups based on desired terminal PDF constraints. Then, an actor-critic-decomposed mass (ACDM) algorithm is developed to attain the optimal control for LS-MAS by solving the coupled MFG forward-backward partial differential equation (PDE) system. While the PDF decomposition expands the neural network structure, it escalates computational complexity. However, the developed algorithm evaluates and balances LS-MAS optimal control efficiency and complexity. In addition, an induction-based proof is provided to demonstrate the reduction of the inefficiency bound between the optimal cost associated with McKean-Vlasov control and the social cost associated with the extended MFG equilibrium. After that, the Lyapunov stability analysis is presented to illustrate the convergence of the ACDM algorithm. Eventually, numerical simulations are provided to validate the proposed approach.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"719 ","pages":"Article 122432"},"PeriodicalIF":6.8000,"publicationDate":"2025-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S002002552500564X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper investigates the tradeoff between optimal efficiency and computational complexity in the emerging mean-field game (MFG) theory and further develops a novel reconfigurable decomposition approach that can balance the efficiency-complexity of MFG theoretical optimal distributed control for large-scale multi-agent systems (LS-MAS). Generally, the MFG has the potential to overcome the “Curse of Dimensionality” in LS-MAS control by simplifying all agents' interactions into ones between individual agents and the collective average effects captured by the group's probability density function (PDF). However, the social cost associated with MFG Nash equilibria is generally inefficient compared to the centralized optimal cost associated with the McKean-Vlasov control problem. To enhance the efficiency of MFG theoretical control without significantly increasing complexity, a novel extended MFG (EMFG) is developed to efficiently balance the MFG efficiency and computational complexity through a decomposed mean field PDF term. Specifically, LS-MAS is divided into multiple groups based on desired terminal PDF constraints. Then, an actor-critic-decomposed mass (ACDM) algorithm is developed to attain the optimal control for LS-MAS by solving the coupled MFG forward-backward partial differential equation (PDE) system. While the PDF decomposition expands the neural network structure, it escalates computational complexity. However, the developed algorithm evaluates and balances LS-MAS optimal control efficiency and complexity. In addition, an induction-based proof is provided to demonstrate the reduction of the inefficiency bound between the optimal cost associated with McKean-Vlasov control and the social cost associated with the extended MFG equilibrium. After that, the Lyapunov stability analysis is presented to illustrate the convergence of the ACDM algorithm. Eventually, numerical simulations are provided to validate the proposed approach.
期刊介绍:
Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions.
Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.