View in EDS

A distributed coding-decoding-based Nash equilibrium seeking algorithm over directed communication network.

Saved in:
Bibliographic Details
Title: A distributed coding-decoding-based Nash equilibrium seeking algorithm over directed communication network.
Authors: Rao, XinPei, Xu, WenYing, Yang, ShaoFu, Yu, WenWu
Source: SCIENCE CHINA Technological Sciences; Jul2023, Vol. 66 Issue 7, p1975-1986, 12p
Abstract: This paper is concerned with the distributed Nash equilibrium (NE) computation problem for non-cooperative games subject to partial-decision information. For the purpose of congestion mitigation, coding-decoding-based schemes are constructed on the basis of logarithmic and uniform quantizers, respectively. To be specific, the data (decision variable) are first mapped to codewords by an encoder scheme, and then sent to the neighboring agents through a directed communication network (with non-doubly stochastic weighted matrix). By using a decoder scheme, a new distributed algorithm is established for seeking the NE. In order to eliminate the convergence error caused by quantization, a dynamic variable is introduced and a modified coding-decoding-based algorithm is constructed under the uniform quantization scheme, which ensures the asymptotic convergence to the NE. The proposed algorithm only requires that the weighted adjacency matrix is row stochastic instead of double stochastic. Finally, one numerical example is provided to validate the effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]
Copyright of SCIENCE CHINA Technological Sciences is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:This paper is concerned with the distributed Nash equilibrium (NE) computation problem for non-cooperative games subject to partial-decision information. For the purpose of congestion mitigation, coding-decoding-based schemes are constructed on the basis of logarithmic and uniform quantizers, respectively. To be specific, the data (decision variable) are first mapped to codewords by an encoder scheme, and then sent to the neighboring agents through a directed communication network (with non-doubly stochastic weighted matrix). By using a decoder scheme, a new distributed algorithm is established for seeking the NE. In order to eliminate the convergence error caused by quantization, a dynamic variable is introduced and a modified coding-decoding-based algorithm is constructed under the uniform quantization scheme, which ensures the asymptotic convergence to the NE. The proposed algorithm only requires that the weighted adjacency matrix is row stochastic instead of double stochastic. Finally, one numerical example is provided to validate the effectiveness of our algorithms. [ABSTRACT FROM AUTHOR]
ISSN:16747321
DOI:10.1007/s11431-022-2333-3