Abstract
This paper investigates multi-coalition games (MCGs) involving players with high-order dynamics, where their decisions satisfy both hard local set constraints and nonlinear coupled inequality constraints. The hard set constraints require that players’ decisions always satisfy the prescribed local set constraints. The coexistence of constraints and high-order dynamics leads to significant challenges for algorithm design and analysis, as the system inertia caused by high-order dynamics prevents direct control of the decisions of players through their inputs. To control the constrained high-order players to perform MCG tasks autonomously and distributedly, based on state feedback, leader-following consensus, dynamic average consensus, projection, and adaptive control methods, a fully distributed algorithm is proposed, where the decisions of all players are ensured to satisfy the set constraints all the time. It allows players to adjust their own parameters by using their procurable feedback errors without requiring direct access to others’ decisions or gradients, eliminating the need for global information and parameters tuning. Furthermore, the convergence of this algorithm is rigorously proven by nonsmooth analysis and Lyapunov stability theory. Finally, the algorithm is applied to the electricity market games (EMGs) of smart grids to demonstrate its effectiveness.
Funding Information
  • National Science and Technology Major Project of China (2022ZD0119702)
  • National Natural Science Foundation of China (62473293)
  • National Natural Science Foundation of China (62088101)
  • Shanghai Municipal Science and Technology Major Project (2021SHZDZX0100)

This publication has 46 references indexed in Scilit: