In this paper, an N-coalitions game of multi-agents system is investigated, which is a combination problem of distributed optimization and game. The objective functions of the coalition depend on not only its members’ decisions, but also the decisions of other coalitions. A algorithm is designed for the agent to seek the Nash equilibrium of the N-coalitions games. By constructing suitable a Lyapunov function, we analyze the convergence of the algorithm, which indicates that algorithm can achieve exponential convergence. Finally, a numerical example is given to illustrate the effectiveness of the methods.
An Algorithm Design for N-coalitions Games
Lect. Notes Electrical Eng.
International Conference on Autonomous Unmanned Systems ; 2021 ; Changsha, China September 24, 2021 - September 26, 2021
Proceedings of 2021 International Conference on Autonomous Unmanned Systems (ICAUS 2021) ; Kapitel : 97 ; 984-990
2022-03-18
7 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Coalitions for distributed sensor fusion
IEEE | 2002
|Coalitions for Distributed Sensor Fusion
British Library Conference Proceedings | 2002
|The nucleolus and the essential coalitions
Springer Verlag | 1980
|Coalitions: More Than Just Flags at the Table
NTIS | 2011
|fire fighting drones capable of identifying the coalitions
Europäisches Patentamt | 2022
|