Distributed Nash equilibrium computation under round-robin scheduling protocol

DOI10.1109/TAC.2023.3262440MaRDI QIDQ6575687zbMATH OpenFDO

Authors Zhangcheng Feng, Wenying Xu, Jinde Cao

Publication date 21 July 2024

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2023.3262440

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Games involving graphs (91A43)

Cited in

(6)

• Distributed inertial online game algorithm for tracking generalized Nash equilibria
• Gradient-tracking-based distributed Nesterov accelerated algorithms for multiple cluster games over time-varying unbalanced digraphs
• Resilient cubature Kalman filtering under round-robin protocol: addressing sensor saturations and channel noises
• Distributed resilient Nash equilibrium seeking for aggregative games of second-order systems under DoS attacks
• Distributed generalized Nash equilibrium seeking approach via surrogate functions for noncooperative nonconvex games
• H_ guaranteed cost filtering for nonlinear system with limited bandwidth and stochastic hybrid attacks

This page was built for publication: Distributed Nash equilibrium computation under round-robin scheduling protocol

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575687)