.png){kind=icon}
返回
Distributed Nash Equilibrium Computation Under Round-Robin Scheduling Protocol
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2023.3262440.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 B-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.
Keyword:
Protocols
Games
Processor scheduling
Convergence
Nash equilibrium
Job shop scheduling
Directed graphs
Distributed computation
Nash equilibrium (NE)
round-robin (RR)
game
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
An actin-mediated two-step mechanism is required for ventral enclosure of the C. elegans hypodermis.png)
Development
DevelopmentIF0
PREAI
分享收藏Adaptive approaches for fully distributed Nash equilibrium seeking in networked gamesAUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏分享收藏分享收藏分享收藏Competing Nonadiabatic Relaxation Pathways for Near-UV Excited ortho-Nitrophenol in Aqueous Solution
OAAI
OAAI分享收藏
查看更多内容