On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
From MaRDI portal
enumerative methodequilibrium selectiongeneralized Nash equilibrium problemmixed-integer nonlinear problem
Numerical optimization and variational techniques (65K10) Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Noncooperative games (91A10) Hierarchical games (including Stackelberg games) (91A65)
Recommendations
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Computing all solutions of linear generalized Nash equilibrium problems
- Solving linear generalized Nash equilibrium problems numerically
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
- Algorithms for generalized potential games with mixed-integer variables
Cites work
- A bridge between bilevel programs and Nash games
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- Algorithms for generalized potential games with mixed-integer variables
- An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- Computing all solutions of linear generalized Nash equilibrium problems
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Gap functions for quasi-equilibria
- Generalized Nash equilibrium problems
- Improved error bound and a hybrid method for generalized Nash equilibrium problems
- Mixed-integer nonlinear optimization
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- On a smooth dual gap function for a class of player convex generalized Nash equilibrium problems
- On differentiability properties of player convex generalized 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
- Partial penalization for the solution of generalized Nash equilibrium problems
- Solving quasi-variational inequalities via their KKT conditions
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- The cone condition and nonsmoothness in linear generalized Nash games
- The noncooperative transportation problem and linear generalized Nash games
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
Cited in
(16)- Algorithms for generalized potential games with mixed-integer variables
- An explicit Tikhonov algorithm for nested variational inequalities
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- Equilibrium selection for multi-portfolio optimization
- Managing Product Transitions: A Bilevel Programming Approach
- Combining approximation and exact penalty in hierarchical programming
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- A branch-and-prune algorithm for discrete Nash equilibrium problems
- A bilevel approach to ESG multi-portfolio selection
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Generalized Nash equilibrium problems with mixed-integer variables
- A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
- Generalized Nash equilibrium problems with quasi-linear constraints
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
This page was built for publication: On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613992)
