The pricing problem. Part II: Computational complexity

DOI10.1134/S1990478913030150MaRDI QIDQ5263797zbMATH OpenOpenAlexFDO

Authors A. A. Panin, A. 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

approximabilityapproximate algorithmapproximation classbilevel problemcomputational complexityNP-hard in the strong sensepolynomial hierarchypricing problem

Mathematics Subject Classification ID

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

Recommendations

• The pricing problem. I: Exact and approximate algorithms
• Complexity of solution structures in nonlinear pricing
• The complexity of optimal multidimensional pricing
• On the complexity of a bundle pricing problem
• Buying cheap is expensive: approximability of combinatorial pricing problems
• On the Complexity of Stackelberg Matroid Pricing Problems
• On the complexity of price equilibria
• scientific article; zbMATH DE number 1094752
• On the minimax complexity of pricing in a changing environment
• On the Complexity of Equilibrium Computation in First-Price Auctions

Cited in

(13)

• A bilevel planning model for public-private partnership
• A capacitated competitive facility location problem
• scientific article; zbMATH DE number 1094752 (Why is no real title available?)
• scientific article; zbMATH DE number 1985662 (Why is no real title available?)
• On the competitive facility location problem with a free choice of suppliers
• Bilevel competitive facility location and pricing problems
• Stability analysis for pricing
• 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
• The pricing problem. I: Exact and approximate algorithms
• On complexity of the bilevel location and pricing problems
• The multilevel facility location and pricing problems: the computational complexity and the stability analysis
• Variable neighborhood descent for finding the threshold stability radius in the facility location and discriminatory pricing problem

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

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