Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
From MaRDI portal
The author considers an \(n\)-person game in which every player minimizes his quadratic cost function without violating certain linear constraint function. For the one-dimensional strategy set of each player an algorithm is provided that computes all solutions and terminates finitely. The effectiveness of the algorithm is shown for various examples.
Recommendations
- Computing all solutions of linear generalized Nash equilibrium problems
- Methods for solving generalized Nash equilibrium
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- A numerical algorithm for finding solutions of a generalized Nash equilibrium problem
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
Cites work
- A globalized Newton method for the computation of normalized Nash equilibria
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis
- Algorithm 457: finding all cliques of an undirected graph
- An improved two-step method for solving generalized Nash equilibrium problems
- Bimatrix Equilibrium Points and Mathematical Programming
- Gap function approach to the generalized Nash equilibrium problem
- Generalized Nash equilibrium problems
- Generalized Nash equilibrium problems and Newton methods
- scientific article; zbMATH DE number 5066291 (Why is no real title available?)
- Nash equilibria: the variational approach
- Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation
- Nonconvex games with side constraints
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Penalty Methods for the Solution of Generalized Nash Equilibrium Problems
- Perturbation approach to generalized Nash equilibrium problems with shared constraints
- Primal-dual methods for vertex and facet enumeration
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Restricted generalized Nash equilibria and controlled penalty algorithm
Cited in
(11)- Algorithms for generalized potential games with mixed-integer variables
- How to select a solution in generalized Nash equilibrium problems
- Computing all solutions of linear generalized Nash equilibrium problems
- A parametrized variational inequality approach to track the solution set of a generalized Nash equilibrium problem
- Local search in quadratic two-person game
- The cone condition and nonsmoothness in linear generalized Nash games
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- A best-response approach for equilibrium selection in two-player generalized Nash equilibrium problems
- scientific article; zbMATH DE number 7742927 (Why is no real title available?)
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Generalized Nash equilibrium problems with mixed-integer variables
This page was built for publication: Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471019)
