@Article{CSIAM-AM-2-162,
author = {Fang , XiaoLü , Jinhu and Wen , Guanghui},
title = {Distributed Finite-Time Nash Equilibrium Seeking for Non-Cooperative Games},
journal = {CSIAM Transactions on Applied Mathematics},
year = {2021},
volume = {2},
number = {1},
pages = {162--174},
abstract = {<p style="text-align: justify;">The paper aims to design a distributed algorithm for players in games such
that the players can learn Nash equilibriums of non-cooperative games in finite time.
We first consider the quadratic non-cooperative games and design estimate protocols
for the players such that they can estimate all the other players&#39; actions in distributed
manners. In order to make the players track all the other players&#39; real actions in finite
time, a bounded gradient dynamics is designed for players to update their actions by
using the estimate information. Then the algorithm is extended to more general non-cooperative games and it is proved that players&#39; estimates can converge to all the other
players&#39; real actions in finite time and all players can learn the unique Nash equilibrium in finite time under mild assumptions. Finally, simulation examples are provided
to verify the validity of the proposed finite-time distributed Nash equilibrium seeking
algorithms.</p>},
issn = {2708-0579},
doi = {https://doi.org/10.4208/csiam-am.2020-0028},
url = {http://global-sci.org/intro/article_detail/csiam-am/18658.html}
}