Distributed Nash Equilibrium Seeking under Quantization Communication

TL;DR

This paper proposes a distributed quantized algorithm for Nash equilibrium seeking in multi-player networks with limited bandwidth, demonstrating exponential convergence and analyzing the impact of bandwidth on convergence rate.

Contribution

It introduces a novel distributed quantized NE seeking algorithm with proven exponential convergence and bandwidth-convergence rate relationship.

Findings

Algorithm achieves exponential convergence

Convergence rate depends on bandwidth

Simulation validates theoretical results

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.