TY - JOUR
T1 - An Augmented Game Approach for Design and Analysis of Distributed Learning Dynamics in Multiagent Games
AU - Tan, Shaolin
AU - Fang, Zhihong
AU - Wang, Yaonan
AU - Lu, Jinhu
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2023/11/1
Y1 - 2023/11/1
N2 - In this article, an augmented game approach is proposed for the formulation and analysis of distributed learning dynamics in multiagent games. Through the design of the augmented game, the coupling structure of utility functions among all the players can be reformulated into an arbitrary undirected connected network while the Nash equilibria are preserved. In this case, any full-information game learning dynamics can be recast into a distributed form, and its convergence can be determined from the structure of the augmented game. We apply the proposed approach to generate both deterministic and stochastic distributed gradient play and obtain several negative convergent results about the distributed gradient play: 1) a Nash equilibrium is convergent under the classic gradient play, yet its corresponding augmented Nash equilibrium may be not convergent under the distributed gradient play and, on the other side, 2) a Nash equilibrium is not convergent under the classic gradient play, yet its corresponding augmented Nash equilibrium may be convergent under the distributed gradient play. In particular, we show that the variational stability structure (including monotonicity as a special case) of a game is not guaranteed to be preserved in its augmented game. These results provide a systematic methodology about how to formulate and then analyze the feasibility of distributed game learning dynamics.
AB - In this article, an augmented game approach is proposed for the formulation and analysis of distributed learning dynamics in multiagent games. Through the design of the augmented game, the coupling structure of utility functions among all the players can be reformulated into an arbitrary undirected connected network while the Nash equilibria are preserved. In this case, any full-information game learning dynamics can be recast into a distributed form, and its convergence can be determined from the structure of the augmented game. We apply the proposed approach to generate both deterministic and stochastic distributed gradient play and obtain several negative convergent results about the distributed gradient play: 1) a Nash equilibrium is convergent under the classic gradient play, yet its corresponding augmented Nash equilibrium may be not convergent under the distributed gradient play and, on the other side, 2) a Nash equilibrium is not convergent under the classic gradient play, yet its corresponding augmented Nash equilibrium may be convergent under the distributed gradient play. In particular, we show that the variational stability structure (including monotonicity as a special case) of a game is not guaranteed to be preserved in its augmented game. These results provide a systematic methodology about how to formulate and then analyze the feasibility of distributed game learning dynamics.
KW - Distributed information
KW - Nash equilibrium seeking
KW - game learning
KW - gradient play
UR - https://www.scopus.com/pages/publications/85130833222
U2 - 10.1109/TCYB.2022.3174196
DO - 10.1109/TCYB.2022.3174196
M3 - 文章
C2 - 35604980
AN - SCOPUS:85130833222
SN - 2168-2267
VL - 53
SP - 6951
EP - 6962
JO - IEEE Transactions on Cybernetics
JF - IEEE Transactions on Cybernetics
IS - 11
ER -