{"title":"通过事件触发通信寻求规定时间多联盟纳什均衡","authors":"","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":null,"pages":null},"PeriodicalIF":5.3000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Prescribed-time multi-coalition Nash equilibrium seeking by event-triggered communication\",\"authors\":\"\",\"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\":null,\"pages\":null},\"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}","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}
Prescribed-time multi-coalition Nash equilibrium seeking by event-triggered communication
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.
期刊介绍:
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.