This paper investigates Nash equilibrium (NE) seeking problems for noncooperative games over multi-agent 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.

翻译：本文件调查了Nash均衡(NE)在使用有限带宽通信的多试剂网络上寻找不合作游戏的问题。介绍了一个分布式量化算法,包括本地梯度游戏、分布式决定估计和适应性量化。算法的指数趋同已经确立,对趋同率和带宽之间的关系进行了定量分析。最后,还模拟了能源消费游戏,以验证提议的结果。