Local search in quadratic two-person game

zbMath1414.91015MaRDI QIDQ2627186

Ilya Mikhailovich Minarchenko

Publication date: 30 May 2017

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

zbMATH Keywords

Nash equilibriumNikaido-Isoda functiond.c.-decompositionalgorithms for computing Nash equilibria

Mathematics Subject Classification ID

Noncooperative games (91A10) Minimax problems in mathematical programming (90C47) 2-person games (91A05)

Related Items

On some approaches to find Nash equilibrium in concave games

Cites Work

• Unnamed Item
• Unnamed Item
• On local search in d.c. optimization problems
• Polymatrix games and optimization problems
• Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
• Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
• Relaxation methods for generalized Nash equilibrium problems with inexact line search
• Equilibrium programming: Gradient methods
• A theorem on the number of Nash equilibria in a bimatrix game
• On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
• Note on noncooperative convex games
• Equilibrium Points in Finite Games
• FINDING NORMALIZED EQUILIBRIUM IN CONVEX-CONCAVE GAMES
• Equilibrium Points of Bimatrix Games
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games