Distributed projection subgradient algorithm for two-network zero-sum game with random sleep scheme
From MaRDI portal
Publication:2138917
Cites work
- An operator splitting approach for distributed generalized Nash equilibria computation
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
- Distributed Nash equilibrium seeking for aggregative games with coupled constraints
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed robust adaptive equilibrium computation for generalized convex games
- Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game
- Multi-cluster distributed optimization via random sleep strategy
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Opinion dynamics in social networks with stubborn agents: equilibrium and convergence rate
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme
- 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)
