Nash equilibrium seeking for \(N\)-coalition noncooperative games
From MaRDI portal
Publication:1626894
DOI10.1016/j.automatica.2018.05.020zbMath1417.91031OpenAlexW2805316908MaRDI QIDQ1626894
Frank L. Lewis, Maojiao Ye, Guoqiang Hu
Publication date: 21 November 2018
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.05.020
Related Items (max. 100)
An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games ⋮ Adaptive approaches for fully distributed Nash equilibrium seeking in networked games ⋮ An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games ⋮ Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games ⋮ Evaluation and learning in two-player symmetric games via best and better responses ⋮ Multi-cluster distributed optimization via random sleep strategy ⋮ Designing an allocation mechanism for a coalitional production game ⋮ No-regret learning for repeated non-cooperative games with lossy bandits ⋮ Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network ⋮ On the linear convergence of distributed Nash equilibrium seeking for multi-cluster games under partial-decision information ⋮ Distributed Nash equilibrium seeking strategies via bilateral bounded gradient approach ⋮ Generalized multi-cluster game under partial-decision information with applications to management of energy Internet ⋮ Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm ⋮ Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game ⋮ Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method ⋮ Solving leaderless multi-cluster games over directed graphs ⋮ Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Distributed convergence to Nash equilibria in two-network zero-sum games
- Distributed gradient algorithm for constrained optimization with application to load sharing in power systems
- Distributed robust adaptive equilibrium computation for generalized convex games
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
- Multi-agent differential graphical games: online adaptive learning solution for synchronization with optimality
- Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
- Distributed Optimization Over Time-Varying Directed Graphs
- Stochastic Nash Equilibrium Seeking for Games with General Nonlinear Payoffs
- Distributed Nash Equilibrium Seeking by a Consensus Based Approach
- Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
- Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
- Nash Equilibrium Seeking in Noncooperative Games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
This page was built for publication: Nash equilibrium seeking for \(N\)-coalition noncooperative games
