通过分布式 Lipschitz 算法寻求有向非光滑多集群博弈的广义纳什均衡

IF 4 3区计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS

IEEE Transactions on Control of Network Systems Pub Date : 2024-03-01 DOI:10.1109/TCNS.2024.3372140

Yue Wei;Xianlin Zeng;Hao Fang;Yulong Ding;Shuxin Ding

{"title":"通过分布式 Lipschitz 算法寻求有向非光滑多集群博弈的广义纳什均衡","authors":"Yue Wei;Xianlin Zeng;Hao Fang;Yulong Ding;Shuxin Ding","doi":"10.1109/TCNS.2024.3372140","DOIUrl":null,"url":null,"abstract":"This article investigates a generalized Nash equilibrium (GNE) seeking strategy for a class of nonsmooth multicluster games. Each cluster consists of several players. The intercluster graph is directed and weight-unbalanced. Moreover, in contrast to previous works of multicluster games, coupled nonsmooth inequality constraints, resource allocation constraints, and nonsmooth payoff functions are considered simultaneously in these multicluster games. For seeking the GNE of these games, a distributed Lipschitz algorithm with the proximal-splitting scheme is proposed. Then, convergence analysis of this designed algorithm is deduced based on the Lyapunov stability theory and the convex optimization theory. Finally, some simulation results are provided in this article, which show the efficacy of the distributed GNE seeking algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 4","pages":"2033-2042"},"PeriodicalIF":4.0000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized Nash Equilibrium Seeking for Directed Nonsmooth Multicluster Games via a Distributed Lipschitz Algorithm\",\"authors\":\"Yue Wei;Xianlin Zeng;Hao Fang;Yulong Ding;Shuxin Ding\",\"doi\":\"10.1109/TCNS.2024.3372140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article investigates a generalized Nash equilibrium (GNE) seeking strategy for a class of nonsmooth multicluster games. Each cluster consists of several players. The intercluster graph is directed and weight-unbalanced. Moreover, in contrast to previous works of multicluster games, coupled nonsmooth inequality constraints, resource allocation constraints, and nonsmooth payoff functions are considered simultaneously in these multicluster games. For seeking the GNE of these games, a distributed Lipschitz algorithm with the proximal-splitting scheme is proposed. Then, convergence analysis of this designed algorithm is deduced based on the Lyapunov stability theory and the convex optimization theory. Finally, some simulation results are provided in this article, which show the efficacy of the distributed GNE seeking algorithm.\",\"PeriodicalId\":56023,\"journal\":{\"name\":\"IEEE Transactions on Control of Network Systems\",\"volume\":\"11 4\",\"pages\":\"2033-2042\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Control of Network Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10457558/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Control of Network Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10457558/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Generalized Nash Equilibrium Seeking for Directed Nonsmooth Multicluster Games via a Distributed Lipschitz Algorithm

This article investigates a generalized Nash equilibrium (GNE) seeking strategy for a class of nonsmooth multicluster games. Each cluster consists of several players. The intercluster graph is directed and weight-unbalanced. Moreover, in contrast to previous works of multicluster games, coupled nonsmooth inequality constraints, resource allocation constraints, and nonsmooth payoff functions are considered simultaneously in these multicluster games. For seeking the GNE of these games, a distributed Lipschitz algorithm with the proximal-splitting scheme is proposed. Then, convergence analysis of this designed algorithm is deduced based on the Lyapunov stability theory and the convex optimization theory. Finally, some simulation results are provided in this article, which show the efficacy of the distributed GNE seeking algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE Transactions on Control of Network Systems Mathematics-Control and Optimization

CiteScore

7.80

自引率

7.10%

发文量

169

期刊介绍： The IEEE Transactions on Control of Network Systems is committed to the timely publication of high-impact papers at the intersection of control systems and network science. In particular, the journal addresses research on the analysis, design and implementation of networked control systems, as well as control over networks. Relevant work includes the full spectrum from basic research on control systems to the design of engineering solutions for automatic control of, and over, networks. The topics covered by this journal include: Coordinated control and estimation over networks, Control and computation over sensor networks, Control under communication constraints, Control and performance analysis issues that arise in the dynamics of networks used in application areas such as communications, computers, transportation, manufacturing, Web ranking and aggregation, social networks, biology, power systems, economics, Synchronization of activities across a controlled network, Stability analysis of controlled networks, Analysis of networks as hybrid dynamical systems.