Prescribed-time multi-coalition Nash equilibrium seeking by event-triggered communication

IF 5.3 1区数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS

Chaos Solitons & Fractals Pub Date : 2024-11-04 DOI:10.1016/j.chaos.2024.115679

Mengwei Sun , Lu Ren , Jian Liu , Changyin Sun

{"title":"Prescribed-time multi-coalition Nash equilibrium seeking by event-triggered communication","authors":"Mengwei Sun , Lu Ren , Jian Liu , Changyin Sun","doi":"10.1016/j.chaos.2024.115679","DOIUrl":null,"url":null,"abstract":"<div><div>This article investigates the event-triggered prescribed-time Nash equilibrium seeking problem among multiple coalitions of agents in noncooperative games. Each coalition acts as a virtual player in the noncooperative game, with decisions made by its member agents. Agents lack complete information about others’ decisions and instead estimate them through a communication graph. An event-triggered prescribed-time multi-coalition Nash equilibrium seeking method is developed based on the leader-following consensus protocol, dynamic average consensus protocol, and gradient play. This method ensures the Nash equilibrium of the multi-coalition game is reached within a prescribed time, even when communication between agents only occurs under specific triggering conditions—effectively conserving communication resources. Unlike existing approaches, the proposed algorithm allows precise settling time assignment without prior knowledge of system parameters. This algorithm also prevents Zeno behavior. Lastly, the efficiency of the designed algorithm is demonstrated through simulation experiments.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"189 ","pages":"Article 115679"},"PeriodicalIF":5.3000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0960077924012311","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

This article investigates the event-triggered prescribed-time Nash equilibrium seeking problem among multiple coalitions of agents in noncooperative games. Each coalition acts as a virtual player in the noncooperative game, with decisions made by its member agents. Agents lack complete information about others’ decisions and instead estimate them through a communication graph. An event-triggered prescribed-time multi-coalition Nash equilibrium seeking method is developed based on the leader-following consensus protocol, dynamic average consensus protocol, and gradient play. This method ensures the Nash equilibrium of the multi-coalition game is reached within a prescribed time, even when communication between agents only occurs under specific triggering conditions—effectively conserving communication resources. Unlike existing approaches, the proposed algorithm allows precise settling time assignment without prior knowledge of system parameters. This algorithm also prevents Zeno behavior. Lastly, the efficiency of the designed algorithm is demonstrated through simulation experiments.

查看原文本刊更多论文

通过事件触发通信寻求规定时间多联盟纳什均衡

本文研究了非合作博弈中多个代理联盟之间的事件触发规定时间纳什均衡寻求问题。每个联盟在非合作博弈中扮演虚拟玩家的角色，由其成员代理做出决策。代理缺乏关于他人决策的完整信息，只能通过通信图来估计。基于领导者-跟随共识协议、动态平均共识协议和梯度博弈，我们开发了一种事件触发的规定时间多联盟纳什均衡寻求方法。这种方法能确保多联盟博弈在规定时间内达到纳什均衡，即使代理之间的通信只在特定触发条件下发生，也能有效地节约通信资源。与现有方法不同的是，所提出的算法无需事先了解系统参数，即可精确分配结算时间。该算法还能防止 Zeno 行为。最后，通过模拟实验证明了所设计算法的效率。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Chaos Solitons & Fractals 物理-数学跨学科应用

CiteScore

13.20

自引率

10.30%

发文量

1087

审稿时长

9 months

期刊介绍： Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.