On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables

DOI10.1080/02331934.2018.1545125zbMath1405.90133OpenAlexW2901247300MaRDI QIDQ4613992

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

zbMATH Keywords

equilibrium selectiongeneralized Nash equilibrium problemmixed-integer nonlinear problemenumerative method

Mathematics Subject Classification ID

Mixed integer programming (90C11) Noncooperative games (91A10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hierarchical games (including Stackelberg games) (91A65) Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Managing Product Transitions: A Bilevel Programming Approach ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ 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 ⋮ Equilibrium selection for multi-portfolio optimization ⋮ An explicit Tikhonov algorithm for nested variational inequalities ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials

Cites Work

• 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
• Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
• Gap functions for quasi-equilibria
• Partial penalization for the solution of generalized Nash equilibrium problems
• Computing equilibria of Cournot oligopoly models with mixed-integer quantities
• On the computation of all solutions of jointly convex generalized Nash equilibrium problems
• Nonsmooth optimization reformulations of player convex 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
• A bridge between bilevel programs and Nash games
• Algorithms for generalized potential games with mixed-integer variables
• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities
• The noncooperative transportation problem and linear generalized Nash games
• Computing all solutions of linear generalized Nash equilibrium problems
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
• Improved error bound and a hybrid method for generalized Nash equilibrium problems
• On the solution of affine generalized Nash equilibrium problems with shared constraints by Lemke's method
• Solving quasi-variational inequalities via their KKT conditions
• Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
• On the solution of the KKT conditions of generalized Nash equilibrium problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• On differentiability properties of player convex generalized Nash equilibrium problems
• An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space
• Mixed-integer nonlinear optimization
• Generalized Nash equilibrium problems