A branch-and-bound algorithm for nonconvex Nash equilibrium problems

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Algorithmic game theory and complexity (91A68)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
A class of problems where dual bounds beat underestimation bounds
Computing equilibria of Cournot oligopoly models with mixed-integer quantities
On the computation of all solutions of jointly convex generalized Nash equilibrium problems
Generalized Nash equilibrium problems and Newton methods
Optimal centered forms
Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
\(\alpha BB\): A global optimization method for general constrained nonconvex problems
Deterministic global optimization. Theory, methods and applications
Computing all solutions of linear generalized Nash equilibrium problems
Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
Note on noncooperative convex games
Non-cooperative games
Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
Nash Equilibria for Noncooperative n-Person Games in Normal Form
Interval Methods for Systems of Equations
Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
Equilibrium points in n -person games
Generalized Nash equilibrium problems
Dual bounding procedures lead to convergent branch-and-bound algorithms
A branch-and-prune algorithm for discrete Nash equilibrium problems

This page was built for publication: A branch-and-bound algorithm for nonconvex Nash equilibrium problems