Distributed Nash equilibrium seeking with order-reduced dynamics based on consensus exact penalty
Shu Liang
Shuyu Liu
Yiguang Hong
Jie Chen
The Department of Control Science and Engineering,Tongji University,Shanghai 201804,China;Shanghai Research Institute for Intelligent Autonomous Systems,Shanghai 201210,China
摘要：In this paper,we consider a networked game with coupled constraints and focus on variational Nash equilibrium seeking.For distributed algorithm design,we eliminate the coupled constraints by employing local Lagrangian functions and construct exact penalty terms to attain multipliers'optimal consensus,which yields a set of equilibrium conditions without any coupled constraint and consensus constraint.Moreover,these conditions are only based on strategy and multiplier variables,without auxiliary variables.Then,we present a distributed order-reduced dynamics that updates the strategy and multiplier variables with guaranteed convergence.Compared with many other distributed algorithms,our algorithm contains no auxiliary variable,and therefore,it can save computation and communication.
机标关键词：consensusdistributeddynamicsexactnashwithbasedequilibrium
论文发表日期：2023-08-05
在线出版日期：2025-08-15（本平台首次上网日期，不代表文献的发表时间）
页数：11( 363-373 )
英文信息