Computing equilibria of Cournot oligopoly models with mixed-integer quantities
From MaRDI portal
Recommendations
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- Computing Cournot-Nash Equilibria
- On Nash-Cournot oligopolistic market equilibrium models with concave cost functions
- scientific article; zbMATH DE number 4041572
- On the Nash-Cournot equilibrium of multi-market oligopolies
Cites work
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computational study of a family of mixed-integer quadratic programming problems
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Generalized Nash equilibrium problems
- Mixed-integer nonlinear optimization
- Mixed-integer quadratic programming
- Nonsmooth optimization reformulations characterizing all solutions of jointly convex generalized Nash equilibrium problems
- Nonsmooth optimization reformulations of player convex generalized Nash equilibrium problems
- 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
- Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games
- Solving quasi-variational inequalities via their KKT conditions
- Sufficient conditions to compute any solution of a quasivariational inequality via a variational inequality
- The complexity of pure Nash equilibria
Cited in
(22)- Algorithms for generalized potential games with mixed-integer variables
- An explicit Tikhonov algorithm for nested variational inequalities
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials
- A decomposition method for a class of convex generalized Nash equilibrium problems
- A note on solving discretely-constrained Nash-Cournot games via complementarity
- Computing equilibria for integer programming games
- On computation of optimal strategies in oligopolistic markets respecting the cost of change
- Equilibrium selection for multi-portfolio optimization
- The noncooperative fixed charge transportation problem
- The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
- Fixed-Point Approaches to Computing Bertrand-Nash Equilibrium Prices Under Mixed-Logit Demand
- Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers
- Algorithms for the Network Oligopoly Problem
- On generalized Nash equilibrium problems with linear coupling constraints and mixed-integer variables
- Combining approximation and exact penalty in hierarchical programming
- The standard pessimistic bilevel problem
- Algorithmic Applications in Management
- 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
- A globally convergent improved BFGS method for generalized Nash equilibrium problems
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems
This page was built for publication: Computing equilibria of Cournot oligopoly models with mixed-integer quantities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684137)
