Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme

DOI10.1007/s11768-021-00055-xzbMath1491.91044OpenAlexW3198824870MaRDI QIDQ2138917

Shiling Li, Jiangxiong Han, Xiaohong Nian, Hongyun Xiong

Publication date: 17 May 2022

Published in: Control Theory and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11768-021-00055-x

zbMATH Keywords

Nash equilibriumzero-sum gameprojection subgradient algorithmrandom sleep schemetime-varying multi-agent network

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Cites Work

• Distributed convergence to Nash equilibria in two-network zero-sum games
• Distributed robust adaptive equilibrium computation for generalized convex games
• Distributed Nash equilibrium seeking for aggregative games with coupled constraints
• An operator splitting approach for distributed generalized Nash equilibria computation
• Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
• Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
• Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
• Multi-cluster distributed optimization via random sleep strategy
• Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
• Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
• Distributed Nash Equilibrium Seeking by a Consensus Based Approach
• Two-Way Gaussian Networks With a Jammer and Decentralized Control