Distributed Nash Equilibrium Seeking under Quantization Communication
Distributed, Parallel, and Cluster Computing
2021-11-16 v2 Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.2106.16002,
title = {Distributed Nash Equilibrium Seeking under Quantization Communication},
author = {Ziqin Chen and Ji Ma and Shu Liang and Li Li},
journal= {arXiv preprint arXiv:2106.16002},
year = {2021}
}
Comments
8 pages, 5 figures