检索结果-南通市图书馆

Distributed Nash Equilibrium Seeking Strategies Under Quantized Communication

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 103-112页

作者： Maojiao Ye Qing-Long Han Lei Ding Shengyuan Xu Guobiao Jia IEEE the School of Automation Nanjing University of Science and TechnologyNanjing 210094China the School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourne VIC 3122Australia the Institute of Advanced Technology Nanjing University of Posts and TelecommunicationsNanjing 210023China

This paper is concerned with distributed Nash equi librium seeking strategies under quantized communication. In the proposed seeking strategy, a projection operator is synthesized with a gradient search method to achieve the optimization o players' objective functions while restricting their actions within required non-empty, convex and compact domains. In addition, a leader-following consensus protocol, in which quantized informa tion flows are utilized, is employed for information sharing among players. More specifically, logarithmic quantizers and uniform quantizers are investigated under both undirected and connected communication graphs and strongly connected digraphs, respec tively. Through Lyapunov stability analysis, it is shown that play ers' actions can be steered to a neighborhood of the Nash equilib rium with logarithmic and uniform quantizers, and the quanti fied convergence error depends on the parameter of the quan tizer for both undirected and directed cases. A numerical exam ple is given to verify the theoretical results.

关键词： Consensus distributed Nash equilibrium seeking projected gradient play quantized communication

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Exponentially convergent distributed Nash equilibrium seeking for constrained aggregative games

引用

Autonomous Intelligent Systems 2022年第1期2卷 71-78页

作者： Shu Liang Peng Yi Yiguang Hong Kaixiang Peng Department of Control Science&Engineering Tongji UniversityShanghai200092China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210China School of Automation and Electrical Engineering University of Science and Technology BeijingBeijing100083China

Distributed Nash equilibrium seeking of aggregative games is investigated and a continuous-time algorithm is *** algorithm is designed by virtue of projected gradient play dynamics and aggregation tracking dynamics,and is applicable to games with constrained strategy sets and weight-balanced communication *** key feature of our method is that the proposed projected dynamics achieves exponential convergence,whereas such convergence results are only obtained for non-projected dynamics in existing works on distributed optimization and equilibrium *** examples illustrate the effectiveness of our methods.

关键词： Distributed algorithms Aggregative games projected gradient play Weight-balanced graph Exponential convergence

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：