Algorithms for generalized potential games with mixed-integer variables
From MaRDI portal
Recommendations
- Decomposition algorithms for generalized potential games
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- A hybrid method for the generalized Nash equilibria
- A survey of static and dynamic potential games
Cites work
- scientific article; zbMATH DE number 3791104 (Why is no real title available?)
- A new error bound result for generalized Nash equilibrium problems and its algorithmic application
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Computing all solutions of linear generalized Nash equilibrium problems
- Computing equilibria of Cournot oligopoly models with mixed-integer quantities
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Decomposition algorithms for generalized potential games
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- 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 characterizing all solutions of jointly convex generalized Nash equilibrium problems
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- On error bounds and Newton-type methods for generalized Nash equilibrium problems
- On smoothness properties of optimal value functions at the boundary of their domain under complete convexity
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Parametrized variational inequality approaches to generalized Nash equilibrium problems with shared constraints
- Partial penalization for the solution of generalized Nash equilibrium problems
- Potential games
- Potential games with continuous player sets
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Solving linear generalized Nash equilibrium problems numerically
- 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
- Variational Analysis
Cited in
(22)- A bilevel approach to ESG multi-portfolio selection
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- Conditionally Optimal Algorithms for Generalized B\"uchi Games
- Vector games with potential function
- Approximate variational inequalities and equilibria
- Nonsingularity and stationarity results for quasi-variational inequalities
- Decomposition algorithms for generalized potential games
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- An inverse-adjusted best response algorithm for Nash equilibria
- How variational rational agents would play Nash: a generalized proximal alternating linearized method
- Managing Product Transitions: A Bilevel Programming Approach
- An explicit Tikhonov algorithm for nested variational inequalities
- Generalized Nash equilibrium and dynamics of popularity of online contents
- The standard pessimistic bilevel problem
- Equilibrium selection for multi-portfolio optimization
- Numerically tractable optimistic bilevel problems
- Integer programming methods for solving binary interdiction games
- The noncooperative fixed charge transportation problem
- Distributed algorithms for convex problems with linear coupling constraints
- The noncooperative transportation problem and linear generalized Nash games
- Generalized Nash equilibrium problems with mixed-integer variables
- Combining approximation and exact penalty in hierarchical programming
This page was built for publication: Algorithms for generalized potential games with mixed-integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694402)
