Algorithms for the Network Oligopoly Problem

DOI10.2307/2582230MaRDI QIDQ3778506zbMATH OpenOpenAlexFDO

Authors P. Marcotte

Publication date 1987

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2582230

zbMATH Keywords

computation of equilibriacongested transportation networksCournot-Nash equilibriaNetwork oligopoly models

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Microeconomic theory (price theory and economic markets) (91B24) General equilibrium theory (91B50)

Recommendations

• Network oligopolies with multiple markets
• scientific article; zbMATH DE number 1225505
• Computing equilibria of Cournot oligopoly models with mixed-integer quantities
• Un algorithme général de calcul de l'état d'équilibre d'un oligopole
• Quelques notes et résultats nouveaux sur le problème d'équilibre d'un oligopole

Cited in

(14)

• Intelligent optimization algorithms: a stochastic closed-loop supply chain network problem involving oligopolistic competition for multiproducts and their product flow routings
• Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities
• Gap functions and penalization for solving equilibrium problems with nonlinear constraints
• Equilibrium computation in resource allocation games
• The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market
• A spatial price equilibrium model in the oligopolistic market for oil derivatives: an application to the brazilian scenario
• Un algorithme général de calcul de l'état d'équilibre d'un oligopole
• scientific article; zbMATH DE number 1225505 (Why is no real title available?)
• scientific article; zbMATH DE number 7378728 (Why is no real title available?)
• Nash equilibria solutions in the competitive salesmen problem on a network
• Merit functions: a bridge between optimization and equilibria
• Merit functions: a bridge between optimization and equilibria
• Complexity and parametric computation of equilibria in atomic splittable congestion games via weighted block Laplacians
• Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition

This page was built for publication: Algorithms for the Network Oligopoly Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778506)