.png){kind=icon}
.png){kind=icon}
Return
Distributed Nash equilibrium seeking under quantization communication
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2022.110318.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-players networks with finite bandwidth communication. A distributed quantized algorithm is presented, which consists of local gradient play, distributed decision estimating, and adaptive quantization. Exponential convergence of the algorithm is established, and a relationship between the convergence rate and the bandwidth is quantitatively analyzed. Finally, a simulation of an energy consumption game is presented to validate the proposed results. (c) 2022 Elsevier Ltd. All rights reserved.
Keywords:
Distributed Nash equilibrium seeking
Quantization communication
Exponential convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.