Incomplete-Information Dynamic Stackelberg Equilibrium Seeking by A Distributed Distributionally Robust Feedback Approach
- 7 October 2025
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (2) , 699-712
Abstract
This article investigates a multileader Stackelberg game where leaders lack critical information about the follower’s objective function and face random disturbances with unknown distributions. Unlike conventional approaches requiring complete follower information, we consider leaders who manipulate physical plant states while observing the follower’s strategy through private tracking responders. To address distributional uncertainty in the follower’s best response, we reformulate the game as a distributionally robust equilibrium-seeking problem and develop a fully distributed FL algorithm. The proposed data-driven approach operates without prior knowledge of system models or disturbance distributions, enabling leaders to estimate states through neighbor communication and local gradient updates. We characterize equilibrium existence in nonconvex settings. The relationship between communication and gradient errors and the energy function of the dynamic system is established. The upper bound of the regret based on the proposed algorithm is rigorously analyzed. A case study demonstrates the framework’s effectiveness in achieving distributionally robust solutions against uncertain stochastic perturbations.Keywords
Funding Information
- National Natural Science Foundation of China (62373226)
- National Natural Science Foundation of China (62133008)
- Natural Science Foundation of Shandong province, China (ZR2022MF227)
This publication has 46 references indexed in Scilit:
- On Distributionally Robust Generalized Nash Games Defined over the Wasserstein BallJournal of Optimization Theory and Applications, 2023
- The Stackelberg equilibrium for one-sided zero-sum partially observable stochastic gamesAutomatica, 2022
- Learning generalized Nash equilibria in multi-agent dynamical systems via extremum seeking controlAutomatica, 2021
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulationsMathematical Programming, 2017
- Random Gradient-Free Minimization of Convex FunctionsFoundations of Computational Mathematics, 2015
- On the rate of convergence in Wasserstein distance of the empirical measureProbability Theory and Related Fields, 2014
- Implicit Functions and Solution Mappings2009
- Tracking control for multi-agent consensus with an active leader and variable topologyAutomatica, 2006
- Robust game theoryMathematical Programming, 2006
- Convex Analysis and Minimization Algorithms I1993