On some approaches to find Nash equilibrium in concave games
From MaRDI portal
Publication:2320285
DOI10.1134/S0005117919050138zbMath1422.91050OpenAlexW2946446382MaRDI QIDQ2320285
Publication date: 22 August 2019
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117919050138
Related Items
On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games, Strongly strategic support of cooperative solutions for games over event trees
Cites Work
- Partial penalization for the solution of generalized Nash equilibrium problems
- Restricted generalized Nash equilibria and controlled penalty algorithm
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- Unconstrained optimization reformulations of equilibrium problems
- Relaxation methods for generalized Nash equilibrium problems with inexact line search
- Relaxation techniques and asynchronous algorithms for on-line computation of non-cooperative equilibria
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Note on noncooperative convex games
- Local search in quadratic two-person game
- Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- On relaxation algorithms in computation of noncooperative equilibria
- An algorithm for finding the absolute extremum of a function
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Generalized Nash equilibrium problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
