Distributed Nash Equilibrium Computation Under Round-Robin Scheduling Protocol

This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is perm...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on automatic control Vol. 69; no. 1; pp. 339 - 346
Main Authors: Feng, Zhangcheng, Xu, Wenying, Cao, Jinde
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithm design and analysis
Algorithms
Convergence
Design of experiments
Directed graphs
Distributed algorithms
Distributed computation
game
Game theory
Graph theory
Nash equilibrium
Nash equilibrium (NE)
Protocols
Round robin
round-robin (RR)
ISSN:0018-9286, 1558-2523
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article is concerned with distributed Nash equilibrium (NE) problem for multiplayer games under the Round-Robin (RR) protocol. For the purpose of effectively mitigating data congestion and saving communication resources, the RR protocol is adopted for each player, under which the player is permitted to transmit data to only one of its neighbors at each time instant. The resulting protocol-induced communication graph become time-varying and even disconnected, even though the original graph is assumed to be strongly connected. The aim of the addressed problem is to develop a distributed algorithm in the partial-decision information setting such the convergence of NE can be guaranteed under the <inline-formula><tex-math notation="LaTeX">B</tex-math></inline-formula>-strong connectivity of graphs and the row-stochasticity of weighted adjacency matrix. The sufficient condition on the convergence of the NE is derived for the algorithm with diminishing step-sizes. Some discussions are provided on convergence rate of the proposed algorithm. Finally, one numerical example is provided to verify the developed algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2023.3262440