Pages that link to "Item:Q2063781"
From MaRDI portal
The following pages link to Nash equilibrium seeking in \(N\)-coalition games via a gradient-free method (Q2063781):
Displaying 10 items.
- A heuristic procedure for seeking equilibria in coalitionless and antagonistic games (Q1287577) (← links)
- Nash equilibrium seeking for \(N\)-coalition noncooperative games (Q1626894) (← links)
- Dynamic generalized Nash equilibrium seeking for \(N\)-coalition noncooperative games (Q2103725) (← links)
- An extremum seeking-based approach for Nash equilibrium seeking in \(N\)-cluster noncooperative games (Q2174006) (← links)
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
- A Unified Strategy for Solution Seeking in Graphical $N$-Coalition Noncooperative Games (Q5211223) (← links)
- Distributed algorithm for nonsmooth multi-coalition games and its application in electricity markets (Q6119755) (← links)
- Nash equilibrium seeking of general linear multi-agent systems in the cooperation-competition network (Q6161372) (← links)
- Distributed Nash equilibrium seeking for multi-agent systems with uncertainty in the cost function (Q6646882) (← links)
- Distributed Nash equilibrium seeking for quadratic games in discrete-time systems with bounded control inputs (Q6669360) (← links)