The pricing problem. Part II: Computational complexity

DOI10.1134/S1990478913030150zbMath1324.68049OpenAlexW2033117827MaRDI QIDQ5263797

A. A. Panin, Aleksandr V. Plyasunov

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478913030150

zbMATH Keywords

computational complexitypolynomial hierarchyapproximate algorithmbilevel problemapproximabilitypricing problemapproximation classNP-hard in the strong sense

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Microeconomic theory (price theory and economic markets) (91B24) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

A bilevel planning model for public-private partnership ⋮ A capacitated competitive facility location problem ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ On the competitive facility location problem with a free choice of suppliers ⋮ Bilevel competitive facility location and pricing problems ⋮ On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies ⋮ A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand ⋮ On complexity of the bilevel location and pricing problems

This page was built for publication: The pricing problem. Part II: Computational complexity