On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
DOI10.1080/02331934.2018.1545125zbMATH Open1405.90133OpenAlexW2901247300MaRDI QIDQ4613992FDOQ4613992
Authors: Simone Sagratella 
Publication date: 28 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1545125
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
generalized Nash equilibrium problemequilibrium selectionmixed-integer nonlinear problemenumerative method
Numerical optimization and variational techniques (65K10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Noncooperative games (91A10) Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hierarchical games (including Stackelberg games) (91A65)
Cites Work
- Mixed-integer nonlinear optimization
- Generalized Nash equilibrium problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An algorithm for solving the variational inequality problem over the fixed point set of a quasi-nonexpansive operator in Euclidean space
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
- Solving quasi-variational inequalities via their KKT conditions
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
- The cone condition and nonsmoothness in linear generalized Nash games
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- 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
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Partial penalization for the solution of generalized Nash equilibrium problems
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- Gap functions for quasi-equilibria
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Algorithms for generalized potential games with mixed-integer variables
- A bridge between bilevel programs and Nash games
- Computing all solutions of linear generalized Nash equilibrium problems
- Improved error bound and a hybrid method for generalized Nash equilibrium problems
- The noncooperative transportation problem and linear generalized Nash games
Cited In (13)
- Combining approximation and exact penalty in hierarchical programming
- Equilibrium selection for multi-portfolio optimization
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming
- A bilevel approach to ESG multi-portfolio selection
- A branch-and-prune algorithm for discrete Nash equilibrium problems
- An explicit Tikhonov algorithm for nested variational inequalities
- Numerical solutions to coupled-constraint (or generalised Nash) equilibrium problems
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
- Managing Product Transitions: A Bilevel Programming Approach
- Generalized Nash equilibrium problems with mixed-integer variables
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)
