EUVIMEDEUVIMED entdecken
Crossref

An Efficient Distributed Nash Equilibrium Seeking With Compressed and Event-Triggered Communication

Xiaomeng Chen, Wei Huo, Yuchi Wu, Subhrakanti Dey, Ling Shi

IEEE Transactions on Automatic Control · 2025-03 · 70 (3) · 2035-2042

DOI: 10.1109/tac.2024.3479008 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Automatic Control, 2025-03. Verfasst von Xiaomeng Chen und 4 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 30 Literaturangaben. Gefördert von: Hong Kong RGC Research.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Distributed Nash equilibrium (NE) seeking problems for networked games have been widely investigated in recent years. Despite the increasing attention, communication expenditure is becoming a major bottleneck for scaling up distributed approaches within limited communication bandwidth between agents. To reduce communication cost, an efficient event-triggered and compressed distributed NE seeking (ETC-DNES) algorithm is proposed in this article to obtain an NE for games over directed graphs, where the communication efficiency is improved by event-triggered exchanges of compressed information among neighbors. ETC-DNES saves communication costs in both transmitted bits and rounds of communication. Furthermore, our method only requires the row-stochastic property of the adjacency matrix, unlike previous approaches that hinged on doubly stochastic communication matrices. We provide convergence guarantees for ETC-DNES on games with restricted strongly monotone mappings and testify its efficiency with no sacrifice on the accuracy. The algorithm and analysis are extended to a compressed algorithm with stochastic event-triggered mechanism, i.e., stochastic event-triggered and compressed distributed NE seeking (SETC-DNES) algorithm. In SETC-DNES, we introduce a random variable in the triggering condition to further enhance the algorithm efficiency. We demonstrate that SETC-DNES guarantees linear convergence to the NE while achieving even greater reductions in communication costs compared to ETC-DNES. Finally, numerical simulations illustrate the effectiveness of the proposed algorithms.

Förderung

  • Hong Kong RGC Research

Zitieren

APA

Chen, X., Huo, W., Wu, Y., Dey, S., & Shi, L. (2025). An Efficient Distributed Nash Equilibrium Seeking With Compressed and Event-Triggered Communication. IEEE Transactions on Automatic Control, 70(3), 2035-2042. https://doi.org/10.1109/tac.2024.3479008

Vancouver

Chen X, Huo W, Wu Y, Dey S, Shi L. An Efficient Distributed Nash Equilibrium Seeking With Compressed and Event-Triggered Communication. IEEE Transactions on Automatic Control. 2025;70(3):2035-2042. doi:10.1109/tac.2024.3479008

BibTeX
@article{Chen2025,
  author = {Chen, Xiaomeng and Huo, Wei and Wu, Yuchi and Dey, Subhrakanti and Shi, Ling},
  title = {An Efficient Distributed Nash Equilibrium Seeking With Compressed and Event-Triggered Communication},
  journal = {IEEE Transactions on Automatic Control},
  year = {2025},
  volume = {70},
  number = {3},
  pages = {2035--2042},
  doi = {10.1109/tac.2024.3479008}
}
Kostenlos starten →