A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
type: Item
instance of: scholarly article
title: A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
zbMATH Open document ID: 1466.91011
author: Julio B. Clempner
published in: Journal of Optimization Theory and Applications
publication date: 2021-06-15T00:00:00Z
Mathematics Subject Classification ID: 91A11
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A15
Mathematics Subject Classification ID: 91A68
zbMATH DE Number: 7359106
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: noncooperative game theory
zbMATH Keywords: algorithm
zbMATH Keywords: regularization
zbMATH Keywords: proximal gradient
MaRDI profile type: Publication
full work available at URL: s10957-021-01812-3
OpenAlex ID: W3125956201
cites work: Equilibrium points in n -person games
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
cites work: On the computation of all solutions of jointly convex generalized Nash equilibrium problems
cites work: Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
cites work: Convergence method, properties and computational complexity for Lyapunov games
cites work: Solving discretely-constrained Nash-Cournot games with an application to power markets
cites work: Solving quasi-variational inequalities via their KKT conditions
cites work: Setting Cournot Versus Lyapunov Games Stability Conditions and Equilibrium Point Properties
cites work: Computing the strong Nash equilibrium for Markov chains games
cites work: An optimal strong equilibrium solution for cooperative multi-leader-follower Stackelberg Markov chains games.
cites work: Q3408896
cites work: Computing all solutions of linear generalized Nash equilibrium problems
cites work: Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
cites work: Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
cites work: A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems
cites work: A Tikhonov regularized penalty function approach for solving polylinear programming problems
cites work: On \(\varepsilon\)-equilibrium point in a noncooperative \(n\)-person game
cites work: The closest solution to the shadow minimum of a cooperative dynamic game
cites work: Computing multiobjective Markov chains handled by the extraproximal method
cites work: An extragradient method for finding the saddle point in an optimal control problem
cites work: Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games
DOI: 10.1007/S10957-021-01812-3
description: scientific article; zbMATH DE number 7359106