Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
From MaRDI portal
Publication:2198544
DOI10.1007/S10957-020-01729-3zbMATH Open1448.91021OpenAlexW3048095589MaRDI QIDQ2198544FDOQ2198544
Authors: Julio B. Clempner, Alexander S. Poznyak 
Publication date: 10 September 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01729-3
Recommendations
- Computing the strong Nash equilibrium for Markov chains games
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
- On the existence of strong Nash equilibria
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
- scientific article; zbMATH DE number 1507320
Cites Work
- Non-cooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- An optimal strong equilibrium solution for cooperative multi-leader-follower Stackelberg Markov chains games.
- Computing the strong Nash equilibrium for Markov chains games
- Solving the Pareto front for multiobjective Markov chains using the minimum Euclidean distance gradient-based optimization method
- Intermediate preferences and stable coalition structures
- Equilibria in a model with partial rivalry
- Second best taxation as a game
- A Social Coalitional Equilibrium Existence Lemma
- Stable coalition structures with a unidimensional set of alternatives
- Convergence method, properties and computational complexity for Lyapunov games
- Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games
- A Tikhonov regularization parameter approach for solving Lagrange constrained optimization problems
- Constructing the Pareto front for multi-objective Markov chains handling a strong Pareto policy approach
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
Cited In (8)
- Computing the Stackelberg/Nash equilibria using the extraproximal method: convergence analysis and implementation details for Markov chains games
- Construction of a strong Nash equilibrium in a class of infinite nonzero-sum games
- On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm
- Interval methods for computing strong Nash equilibria of continuous games
- Computing the strong Nash equilibrium for Markov chains games
- Variational inequalities, Ky Fan minimax inequality; and strong Nash equilibria in generalized games
- A proximal/gradient approach for computing the Nash equilibrium in controllable Markov games
- Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness
This page was built for publication: Finding the strong Nash equilibrium: computation, existence and characterization for Markov games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198544)
