Use of branch and bound method for search of an equilibrium in potential Cournot model
From MaRDI portal
(Redirected from Publication:307757)
Recommendations
- Numerical search of equilibrium in Cournot model with \(S\)-like costs functions
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Iterative computation of Cournot equilibrium
- An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Model
- Application of a discrete fixed point theorem to the Cournot model
- scientific article; zbMATH DE number 609916
- Computing Cournot equilibrium through maximization over prices
- A jointly constrained bilinear programming method for solving generalized Cournot-Pareto models
- Adjustment process-based approach for computing a Nash-Cournot equilibrium
- An algorithm for the search of equilibrium in a linear exchange model
Cites work
- scientific article; zbMATH DE number 3972626 (Why is no real title available?)
- scientific article; zbMATH DE number 1255531 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Cournot games with biconcave demand
- Game Theory
- Games with forbidden situations. Models with soft constraints
- Guaranteed results in games with forbidden situations
- Nonlinear oligopolies. Stability and bifurcations
- Numerical search of equilibrium in Cournot model with \(S\)-like costs functions
- Oligopoly. Old ends -- new means.
- Peculiarities of equilibria in the forbidden-situation games
- Potential games
- Supply-and-demand price alignment in the distribution of power in a multiprocessor system
This page was built for publication: Use of branch and bound method for search of an equilibrium in potential Cournot model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307757)
