Open this publication in new window or tab >>Show others...
2024 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 162, article id 111486Article in journal (Refereed) Published
Abstract [en]
In this paper, we study the problem of consensus-based distributed Nash equilibrium (NE) seeking in a network of players represented as a directed graph, where each player aims to minimize their own local cost functions non-cooperatively. To address bandwidth constraints and limited energy, we propose a stochastic event-triggered algorithm that triggers individual players with a probability depending on certain events, thus enhancing communication efficiency through reduced continuous communication. We prove that our developed event-triggered algorithm achieves exponential convergence to the exact NE when the underlying communication graph is strongly connected. Furthermore, we establish that our proposed event-triggered communication scheme does not exhibit Zeno behavior. Finally, through numerical simulations of a spectrum access game and comparisons with existing event-triggered methods, we demonstrate the effectiveness of our proposed algorithm.
Place, publisher, year, edition, pages
Elsevier BV, 2024
Keywords
Distributed algorithm, Event-triggered communication, Nash equilibrium
National Category
Control Engineering
Identifiers
urn:nbn:se:kth:diva-367080 (URN)10.1016/j.automatica.2023.111486 (DOI)001170489100001 ()2-s2.0-85183122273 (Scopus ID)
Note
QC 20250715
2025-07-152025-07-152025-07-15Bibliographically approved