Generalized Nash equilibrium problems with mixed-integer variables
From MaRDI portal
Cites work
- A class of games possessing pure-strategy Nash equilibria
- A course in game theory.
- Algorithms for generalized potential games with mixed-integer variables
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Competitive equilibrium in an exchange economy with indivisibilities
- Computing all solutions of linear generalized Nash equilibrium problems
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Computing equilibria for integer programming games
- Convex Analysis
- Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Extended formulations in combinatorial optimization
- Finding all solutions of affine generalized Nash equilibrium problems with one-dimensional strategy sets
- Generalized Nash equilibrium problems
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3092990 (Why is no real title available?)
- Note on noncooperative convex games
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- On the computation of all solutions of jointly convex generalized Nash equilibrium problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the definition and computation of rectilinear convex hulls
- On the existence of supply function equilibria
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Optimization reformulations of the generalized Nash equilibrium problem using Nikaido-Isoda-type functions
- Rational generating functions and integer programming games
- Solving linear generalized Nash equilibrium problems numerically
- The cone condition and nonsmoothness in linear generalized Nash games
- The noncooperative transportation problem and linear generalized Nash games
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming
- Totally unimodular congestion games
This page was built for publication: Generalized Nash equilibrium problems with mixed-integer variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665384)