Algorithms for generalized potential games with mixed-integer variables

DOI10.1007/s10589-017-9927-4zbMath1390.91023OpenAlexW2736942756MaRDI QIDQ1694402

Simone Sagratella

Publication date: 1 February 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11573/1118571

zbMATH Keywords

parametric optimizationgeneralized Nash equilibrium problemmixed-integer nonlinear problemgeneralized potential game

Mathematics Subject Classification ID

Noncooperative games (91A10) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Managing Product Transitions: A Bilevel Programming Approach, Vector games with potential function, Distributed algorithms for convex problems with linear coupling constraints, Combining approximation and exact penalty in hierarchical programming, Numerically tractable optimistic bilevel problems, Approximate variational inequalities and equilibria, Nonsingularity and stationarity results for quasi-variational inequalities, A bilevel approach to ESG multi-portfolio selection, An Inverse-Adjusted Best Response Algorithm for Nash Equilibria, On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables, Equilibrium selection for multi-portfolio optimization, The noncooperative transportation problem and linear generalized Nash games, An explicit Tikhonov algorithm for nested variational inequalities, The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials, Generalized Nash equilibrium and dynamics of popularity of online contents, The noncooperative fixed charge transportation problem, The Standard Pessimistic Bilevel Problem

Cites Work

• Unnamed Item
• The cone condition and nonsmoothness in linear generalized Nash games
• Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
• Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
• Gap functions for quasi-equilibria
• Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
• Partial penalization for the solution of generalized Nash equilibrium problems
• Nonsmooth optimization reformulations characterizing all solutions of jointly convex 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
• Decomposition algorithms for generalized potential games
• Potential games
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Computing all solutions of linear generalized Nash equilibrium problems
• On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
• Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
• Improved error bound and a hybrid method for generalized Nash equilibrium problems
• Solving quasi-variational inequalities via their KKT conditions
• Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
• Solving linear generalized Nash equilibrium problems numerically
• On the solution of the KKT conditions of generalized Nash equilibrium problems
• Branching and bounds tighteningtechniques for non-convex MINLP
• Variational Analysis
• Mixed-integer nonlinear optimization
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• Generalized Nash equilibrium problems
• Potential games with continuous player sets