An alternating direction method for Nash equilibrium of two-person games with alternating offers
From MaRDI portal
Publication:353164
DOI10.1007/S10957-012-0165-8zbMATH Open1275.91010OpenAlexW2152304928MaRDI QIDQ353164FDOQ353164
Authors: Zheng Peng, Wenxing Zhu 
Publication date: 12 July 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0165-8
Recommendations
- A continuation method for Nash equilibria in structured games
- An optimization approach for approximate Nash equilibria
- Differential extragradient method for finding an equilibrium in two-person saddle-point games
- Differential extraproximal method for finding an equilibrium in two-person saddle-point games
- Extragradient method for searching for an equilibrium point in two-person saddle-point games
- Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
- On a general scheme of constructing iterative methods for searching for a Nash equilibrium in concave games
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- An algorithm for finding approximate Nash equilibria in bimatrix games
2-person games (91A05) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Cites Work
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Non-cooperative games
- Generalized Nash equilibrium problems
- Application of the alternating direction method of multipliers to separable convex programming problems
- A new inexact alternating directions method for monotone variational inequalities
- A family of projective splitting methods for the sum of two maximal monotone operators
- A course in game theory.
- Nonzero-Sum Two-Person Repeated Games with Incomplete Information
- Extra-proximal methods for solving two-person nonzero-sum games
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- An improved two-step method for solving generalized Nash equilibrium problems
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Generalized Nash equilibrium problems and Newton methods
- On the Numerical Integration of $\frac{\partial ^2 u}{\partial x^2 } + \frac{\partial ^2 u}{\partial y^2 } = \frac{\partial u}{\partial t}$ by Implicit Methods
- Title not available (Why is that?)
- Decomposition algorithms for generalized potential games
- Computing Cournot equilibrium through maximization over prices
- Some projection-like methods for the generalized Nash equilibria
- A trust region algorithm for Nash equilibrium problems
- Title not available (Why is that?)
- A proximal alternating direction method for weakly coupled variational inequalities
- Slightly altruistic equilibria
Cited In (6)
- A hybrid splitting method for solving a leader-followers game
- A dynamic lane-changing decision and trajectory planning model of autonomous vehicles under mixed autonomous vehicle and human-driven vehicle environment
- A nonlinear Jacobi method for finding Nash equilibrium of simultaneous games
- Customized proximal point algorithm for Nash equilibrium of two-player games
- A hybrid splitting method for a class of two-by-two alternative games
- How variational rational agents would play Nash: a generalized proximal alternating linearized method
This page was built for publication: An alternating direction method for Nash equilibrium of two-person games with alternating offers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353164)
