Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
DOI10.1007/S11768-021-00055-XzbMATH Open1491.91044OpenAlexW3198824870MaRDI QIDQ2138917FDOQ2138917
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
Nash equilibriumzero-sum gameprojection subgradient algorithmrandom sleep schemetime-varying multi-agent network
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
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Distributed robust adaptive equilibrium computation for generalized convex games
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- 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
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Multi-cluster distributed optimization via random sleep strategy
- Two-Way Gaussian Networks With a Jammer and Decentralized Control
Cited In (1)
This page was built for publication: Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138917)
