  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.
