Distributed Proportional-Integral Algorithms for Multiple Coalition Games Under Limited Communication Resources

• Published in: IEEE transactions on signal and information processing over networks Vol. 11; pp. 450 - 459
• Main Authors: Liu, Jiaxun, Wang, Dong, Liu, Jiashuo, Dong, Xiwang
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2025; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Artificial intelligence; Bandwidth; Bit rate; bit rates; coalition estimate strategies; Coding; Communication; Convergence; Cost function; Costs; Decoding; Distributed algorithms; Estimation; Game theory; Games; limited communication resources; Multiple coalition games; Proportional integral; Topology; Unmanned vehicles
• ISSN: 2373-776X; 2373-7778
• DOI: 10.1109/TSIPN.2025.3559442

This paper studies the algorithm design for multiple coalition games under limited communication resources, in which the players in the same coalition cooperatively optimize the summation of cost functions in this coalition and do not care about the costs of other coalitions. To address this game, we develop a distributed proportional-integral algorithm based on the coalition estimate strategy and the proportional-integral principle. Furthermore, when the communication resource is concretely quantified by bit rates in communication channels, we propose a coding-decoding-based distributed proportional-integral algorithm based on the distributed proportional-integral algorithm and coding-decoding rules for seeking the Nash equilibrium of multiple coalition games. It proves that both algorithms linearly and precisely converge to the Nash equilibrium in spite of limited communication resources. Then, the necessary and sufficient condition for the linear convergence of the proposed algorithm about the requirement of bit rates is presented. Moreover, the relationship between the bit rate and the convergence speed of the proposed algorithm is also theoretically explained. Lastly, the simulation in formation problems of unmanned vehicle swarms is presented to demonstrate the effectiveness of proposed algorithms.