Computing equilibria of Cournot oligopoly models with mixed-integer quantities
From MaRDI portal
Publication:684137
DOI10.1007/s00186-017-0599-8zbMath1408.91150OpenAlexW2673442559MaRDI QIDQ684137
Publication date: 9 February 2018
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11573/1118569
Mixed integer programming (90C11) Noncooperative games (91A10) Special types of economic markets (including Cournot, Bertrand) (91B54) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)
Related Items (12)
A decomposition method for a class of convex generalized Nash equilibrium problems ⋮ Combining approximation and exact penalty in hierarchical programming ⋮ Approximate variational inequalities and equilibria ⋮ 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 ⋮ On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables ⋮ Equilibrium selection for multi-portfolio optimization ⋮ An explicit Tikhonov algorithm for nested variational inequalities ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ The noncooperative fixed charge transportation problem ⋮ The Standard Pessimistic Bilevel Problem
Cites Work
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- 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
- Computational study of a family of mixed-integer quadratic programming problems
- 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
- Solving quasi-variational inequalities via their KKT conditions
- Computing All Solutions of Nash Equilibrium Problems with Discrete Strategy Sets
- On the solution of the KKT conditions of generalized Nash equilibrium problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- The complexity of pure Nash equilibria
- Mixed-integer quadratic programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Mixed-integer nonlinear optimization
- Generalized Nash equilibrium problems
This page was built for publication: Computing equilibria of Cournot oligopoly models with mixed-integer quantities
