Algorithms for the Network Oligopoly Problem

DOI10.2307/2582230zbMath0637.90014OpenAlexW4247410727MaRDI QIDQ3778506

Patrice 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

Cournot-Nash equilibriacomputation of equilibriacongested transportation networksNetwork oligopoly models

Mathematics Subject Classification ID

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

Related Items (9)

Equilibrium computation in resource allocation games ⋮ Reaction function based dynamic location modeling in Stackelberg-Nash-Cournot competition ⋮ Gap functions and penalization for solving equilibrium problems with nonlinear constraints ⋮ Differentiated oligopolistic markets with concave cost functions via Ky Fan inequalities ⋮ Unnamed Item ⋮ Merit functions: a bridge between optimization and equilibria ⋮ Merit functions: a bridge between optimization and equilibria ⋮ A spatial price equilibrium model in the oligopolistic market for oil derivatives: an application to the brazilian scenario ⋮ The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market

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