Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
From MaRDI portal
Publication:2828338
DOI10.1137/15M1052445zbMath1414.91017arXiv1512.00653OpenAlexW2963899121MaRDI QIDQ2828338
Publication date: 25 October 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.00653
Integer programming (90C10) Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (16)
A decomposition method for a class of convex generalized Nash equilibrium problems ⋮ A bridge between bilevel programs and Nash games ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ A branch-and-prune algorithm for discrete Nash equilibrium problems ⋮ A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies ⋮ A bilevel approach to ESG multi-portfolio selection ⋮ Algorithms for generalized potential games with mixed-integer variables ⋮ Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming ⋮ On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables ⋮ Equilibrium selection for multi-portfolio optimization ⋮ Computing equilibria of Cournot oligopoly models with mixed-integer quantities ⋮ An explicit Tikhonov algorithm for nested variational inequalities ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ A parametrized variational inequality approach to track the solution set of a generalized Nash equilibrium problem ⋮ The noncooperative fixed charge transportation problem ⋮ The Standard Pessimistic Bilevel Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving discretely-constrained Nash-Cournot games with an application to power markets
- Solving discretely constrained, mixed linear complementarity problems with applications in energy
- 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
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- Decomposition algorithms for generalized potential games
- Interfaces to PATH 3.0: Design, implementation and usage
- Competitive equilibrium in an exchange economy with indivisibilities
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Computing integral solutions of complementarity problems
- Solving quasi-variational inequalities via their KKT conditions
- Non-cooperative games
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- On the Solutions of Discrete Nonlinear Complementarity and Related Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- The complexity of pure Nash equilibria
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Mixed-integer nonlinear optimization
- Equilibrium points in n -person games
- Generalized Nash equilibrium problems
This page was built for publication: Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
